#

LR parser

In computer science, LR parsers are a type of bottom-up parser that analyse deterministic context-free languages in linear time.[1] There are several variants of LR parsers: SLR parsers, LALR parsers, Canonical LR(1) parsers, Minimal LR(1) parsers, and GLR parsers. LR parsers can be generated by a parser generator from a formal grammar defining the syntax of the language to be parsed. They are widely used for the processing of computer languages.

Organization
Website
Wikipedia: 维基百科

相关主题

ll-parser

ctpg

@peter-winter

Compile Time Parser Generator is a C++ single header library which takes a language description as a C++ code and turns it into a LR1 table parser with a deterministic finite automaton lexical analyze...

翻译 - Compile Time Parser Generator 是一个 C++ 单头库，它将语言描述作为 C++ 代码并将其转换为具有确定性有限自动机词法分析器的 LR1 表解析器，所有这些都在编译时完成。

compile-time Parsing C++cpp17 header-only Regular expression compiler-compiler LR parser lookahead

C++457

4 个月前