Recursive descent parser: Difference between revisions

Revision as of 08:40, 5 January 2020

Revision as of 19:41, 6 February 2020

Line 348:

end;

</source>

== Examples ==

*[[ANTLR]] – aSome recursive descent parser generatorgenerators:

*[[TMG (language)|TMG]] – an early compiler-compiler used in the 1960s and early 1970s

*[[JavaCC]]

*[[Coco/R]]

*[[ANTLR]]

*[[Spirit Parser Framework]] – a C++ recursive descent parser generator framework requiring no pre-compile step

*[[parboiled (Java)]] – a recursive descent [[Parsing expression grammar|PEG]] parsing library for [[Java (programming language)|Java]]

==See also==

*[[JavaCC]] – a recursive descent parser generator

*[[Coco/R]] – a recursive descent parser generator

*[[ANTLR]] – a recursive descent parser generator

*[[Parsing expression grammar]] – another form representing recursive descent grammar

*[[Spirit Parser Framework]] – a C++ recursive descent parser generator framework requiring no pre-compile step

*[[Tail recursive parser]] – a variant of the recursive descent parser

*[[parboiled (Java)]] – a recursive descent [[Parsing expression grammar|PEG]] parsing library for [[Java (programming language)|Java]]

*[[Recursive ascent parser]]

* [http://sourceforge.net/projects/bnf2xml/ bnf2xml] Markup input with XML tags using advanced BNF matching. (a top town LL recursive parser, front to back text, no compiling of lexor is needed or used)