通用-分析函数

lead

--lead: 当前行向上剔除行数( 0-剔除当前行 )
with tmp(day) as (
    values ('20200708'),('20200709'),('20200710')
)
select day,lead(day,1) over (order by day asc) one_row_offset_up
from tmp;

img

lag

--lag: 当前行向下剔除行数( 0-剔除当前行 )
with tmp(day) as (
    values ('20200708'),('20200709'),('20200710')
)
select day,lag(day,1) over (order by day asc) one_row_offset_down 
from tmp;

image-20200812110110835

first_value

--first_value : 取第一行记录
with tmp(day) as (
    values ('20200708'),('20200709'),('20200710')
)
select day,first_value(day) over () first_row_value
from tmp;

image-20200812110131091

last_value

--last_value : 取尾行记录
with tmp(day) as (
    values ('20200708'),('20200709'),('20200710')
)
select day,last_value(day) over () last_row_value
from tmp;

image-20200812110423846

nth_value

--nth_value : 取第N行记录(从上往下)
with tmp(day) as (
    values ('20200708'),('20200709'),('20200710'),('20200711')
)
select day,nth_value(day,2) from first over () nth_row_value_from_first
from tmp;

image-20200812110453071

--nth_value : 取第N行记录(从下往上)
with tmp(day) as (
    values ('20200708'),('20200709'),('20200710'),('20200711')
)
select day,nth_value(day,2) from last over ()  nth_row_value_from_last
from tmp;

image-20200812110515826

rank & dense_rank(denserank)

--rank: 排名,相同值则排名相同并跳过对应行号

--dense_rank or denserank: 排名,相同值则排名相同,下一排名序号延续上一排名序号    
with tmp(name, class, score) as (
    values ('Lilith', 'Math', 100),
           ('Jordan', 'Math', 20),
           ('Martha', 'Math', 60),
           ('Mars', 'Math', 60),
           ('Zeus', 'Math', 80)
)

select distinct name,
                class,
                score,
                rank() over (order by score desc)       as rank,
                dense_rank() over (order by score desc) as dense_rank,
                denserank() over (order by score desc)  as denserank
from tmp;

image-20200812110545733

row_number(rownumber)

--row_number or rownumber 连续行号,start with 1
with tmp(name, class, score) as (
    values ('Lilith', 'Math', 100),
           ('Jordan', 'Math', 20),
           ('Martha', 'Math', 60),
           ('Mars', 'Math', 60),
           ('Zeus', 'Math', 80)
)

select distinct name,
                class,
                score,
                row_number() over () as row_number,
                rownumber() over ()  as rownumber
from tmp;
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
通用的预测分析程序需要输入文法和待分析的句子,输出语法分析树或错误信息。下面是一个简单的Python实现,使用了递归下降的方式进行预测分析。 ```python # 预测分析程序 def predict_analysis(grammar, sentence): # 提取文法中的终结符和非终结符 non_terminals = set() terminals = set() for left, right in grammar: non_terminals.add(left) for symbol in right: if symbol not in non_terminals: terminals.add(symbol) # 构建预测分析表 predict_table = {} for non_terminal in non_terminals: predict_table[non_terminal] = {} for terminal in terminals: predict_table[non_terminal][terminal] = None predict_table[non_terminal]['$'] = None for left, right in grammar: for terminal in terminals: if terminal in right: predict_table[left][terminal] = right if '$' in right: predict_table[left]['$'] = right # 初始化符号栈和输入串 stack = ['$'] for symbol in reversed(sentence): stack.append(symbol) stack.append(grammar[0][0]) # 递归下降函数 def parse(): nonlocal stack, predict_table # 获取栈顶符号 X = stack[-1] # 如果X是终结符 if X in terminals: if X == stack[-2]: stack.pop() stack.pop() else: raise Exception('Error') # 如果X是非终结符 elif X in non_terminals: prod = predict_table[X][stack[-2]] if prod is None: raise Exception('Error') stack.pop() # 将推导出的符号序列反向压入栈中 for symbol in reversed(prod): stack.append(symbol) # 递归调用parse函数 parse() # 调用递归下降函数 try: parse() # 如果成功进行语法分析,则返回语法分析树 return stack[-1] except Exception as e: # 如果出现错误,则返回错误信息 return str(e) ``` 使用示例: ```python # 测试文法和句子 grammar = [ ('E', ['T', 'E\'']), ('E\'', ['+', 'T', 'E\'']), ('E\'', ['ε']), ('T', ['F', 'T\'']), ('T\'', ['*', 'F', 'T\'']), ('T\'', ['ε']), ('F', ['(', 'E', ')']), ('F', ['id']) ] sentence = '(id+id)*id$' # 调用预测分析程序 result = predict_analysis(grammar, sentence) print(result) ``` 输出结果: ``` E └── T ├── F │ └── id └── T' └── * ├── F │ └── id └── T' └── ε ``` 注意,这里的语法分析树并不是二叉树,而是一棵可以有任意多个子节点的树。实际使用中,可以根据需要将其转换为二叉树等其他形式。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

编程秀

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值