Content deleted Content added
m sp. |
Brynosaurus (talk | contribs) added pointer to parsing expression grammars |
||
Line 27:
To determine which rule should be applied in case of a certain terminal the same algorithm can be used as the one for constructing the parsing table of an [[LL parser]].
=== Formalizing recursive descent parsers ===
Although [[context-free grammar]]s are commonly used to [[formal|formalize]] the syntax of the language recognized by a recursive descent parser (as in the example above), an alternate and more direct way to formalize recursive descent parsing is via [[parsing expression grammar]]s, which model the structure and behavior of typical recursive descent parsers directly.
=== Implementation in functional languages ===
| |||