BriefGPT.xyz
Oct, 2020
优化LL(k)解析的LL(finite)策略
The LL(finite) strategy for optimal LL(k) parsing
HTML
PDF
Peter Belcak
TL;DR
提出了LL(finite)解析策略,用于解析LL(k)文法,其中k无需知道,该策略使用线性时间解析输入,使用任意但始终最小的向前看符号来消除非终结符的二义性,且在执行向前扫描终结符的次数方面最优,同时修改了算法以解决由优先级引起的语法歧义 - - 有效地将输入解释为解析表达式文法 - - 以及支持谓词,并且一个名为Astir的开源解析器生成器使用LL(finite)策略生成输出。
Abstract
The LL(finite) parsing strategy for parsing of LL(k) grammars where k needs not to be known is presented. The strategy parses input in
linear time
, uses arbitrary but always
minimal lookahead
necessary to disambi
→