| tech,5-1-E91-1012,ak | purely functional implementation of <term> | LR-parsers | </term> is given , together with a simple | #21460 A purely functional implementation of LR-parsers is given, together with a simple correctness proof. | |
| other,12-3-E91-1012,ak | <term> parser </term> is cubic if the <term> | functions | </term> that constitute the <term> parser </term> | #21495 For non-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,20-3-E91-1012,ak | <term> parser </term> are implemented as <term> | memo-functions | </term> , i.e. <term> functions </term> that | #21503 For non-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,0-4-E91-1012,ak | results of previous invocations . <term> | Memo-functions | </term> also facilitate a simple way to | #21515 For non-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. Memo-functions also facilitate a simple way to construct a very compact representation of the parse forest. | |
| 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. |
