| tech,5-1-E91-1012,ak | A purely functional implementation of <term> LR-parsers </term> is given , together with a simple <term> correctness proof </term> . | #21460 A purely functional implementation of LR-parsers is given, together with a simple correctness proof. | |
| other,12-3-E91-1012,ak | For <term> non-LR grammars </term> the <term> time-complexity </term> of our <term> parser </term> is cubic if the <term> functions </term> that constitute the <term> parser </term> are implemented as <term> memo-functions </term> , i.e. <term> functions </term> that memorize the results of previous invocations . | #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 | For <term> non-LR grammars </term> the <term> time-complexity </term> of our <term> parser </term> is cubic if the <term> functions </term> that constitute the <term> parser </term> are implemented as <term> memo-functions </term> , i.e. <term> functions </term> that memorize the results of previous invocations . | #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 | For <term> non-LR grammars </term> the <term> time-complexity </term> of our <term> parser </term> is cubic if the <term> functions </term> that constitute the <term> parser </term> are implemented as <term> memo-functions </term> , i.e. <term> functions </term> that memorize the results of previous invocations . <term> Memo-functions </term> also facilitate a simple way to construct a very compact <term> representation </term> of the <term> parse forest </term> . | #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> at the right hand side ) can be parsed with a simple modification of the <term> LR-parser </term> for <term> normal CF grammars </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. |
