Recursive descent parser generator: Difference between revisions
Content added Content deleted
m (→{{header|C++}}) |
|||
| Line 17: | Line 17: | ||
=={{header|C++}}== |
=={{header|C++}}== |
||
{{works with|C++11}} |
|||
This program translates an annotated LL(1) grammar into a C++ lexer plus parser. Each rule is required to return a string of some kind and the return values of the already matched nonterminals (and matched text of terminals) can be accessed with $1, $2, etc. which are replaced by the appropriate string variable. |
This program translates an annotated LL(1) grammar into a C++ lexer plus parser. Each rule is required to return a string of some kind and the return values of the already matched nonterminals (and matched text of terminals) can be accessed with $1, $2, etc. which are replaced by the appropriate string variable. |
||