| tech,1-3-E91-1012,ak | recursive descent parser </term> . For <term> | non-LR grammars | </term> the <term> time-complexity </term> of | #21484 Fornon-LR grammars the time-complexity of our parser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. | |
| other,4-6-E91-1012,ak | <term> Extended CF grammars </term> ( <term> | grammars | </term> with <term> regular expressions </term> | #21571 Extended CF grammars (grammars with regular expressions at the right hand side) can be parsed with a simple modification of the LR-parser for normal CF grammars. |
