论文标题
解析表达GLL
Parsing Expression GLL
论文作者
论文摘要
本文介绍了无上下文语法的GLL解析算法的扩展，该算法也支持具有有序选择和Lookahead的解析表达语法。新的PEGLL算法保留了对无序选择的支持，因此解析了无上下文的语法和解析表达语法的常见超集。作为这项工作的一部分，作者已经修改了现有的GLL解析器，以支持解析表达语法，添加了用于常见解析表达式的操作员，并修改Lexer算法以更好地支持有序的选择。
This paper presents an extension of the GLL parsing algorithm for context-free grammars which also supports parsing expression grammars with ordered choice and lookahead. The new PEGLL algorithm retains support for unordered choice, and thus parses a common superset of context-free grammars and parsing expression grammars. As part of this work, the authors have modified an existing GLL parser-generator to support parsing expression grammars, adding operators for common parsing expressions and modifying the lexer algorithm to better support ordered choice.
