| other,4-3-E91-1012,ak | For <term> non-LR grammars </term> the <term> | time-complexity | </term> of our <term> parser </term> is cubic | #21487 For non-LR grammars thetime-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,25-6-E91-1012,ak | modification of the <term> LR-parser </term> for <term> | normal CF grammars | </term> . In this paper I will argue for | #21592 Extended CF grammars (grammars with regular expressions at the right hand side) can be parsed with a simple modification of the LR-parser fornormal CF grammars. |
