| 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 asmemo-functions, i.e. functions that memorize the results of previous invocations. | |
| other,1-5-E91-1012,ak | For <term> LR ( 0 ) grammars </term> , our <term> algorithm </term> is closely related to the <term> recursive ascent parsers </term> recently discovered by Kruseman Aretz \ [ 1 \ ] and Roberts \ [ 2 \ ] . | #21533 ForLR ( 0 ) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\]. | |
| other,14-4-E91-1012,ak | <term> Memo-functions </term> also facilitate a simple way to construct a very compact <term> representation </term> of the <term> parse forest </term> . | #21529 Memo-functions also facilitate a simple way to construct a very compact representation of theparse forest. | |
| tech,8-2-E91-1012,ak | It is presented as a <term> generalization </term> of the <term> recursive descent parser </term> . | #21479 It is presented as a generalization of therecursive descent parser. | |
| other,25-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> . | #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. | |
| other,13-1-E91-1012,ak | A purely functional implementation of <term> LR-parsers </term> is given , together with a simple <term> correctness proof </term> . | #21468 A purely functional implementation of LR-parsers is given, together with a simplecorrectness proof. | |
| other,0-6-E91-1012,ak | For <term> LR ( 0 ) grammars </term> , our <term> algorithm </term> is closely related to the <term> recursive ascent parsers </term> recently discovered by Kruseman Aretz \ [ 1 \ ] and Roberts \ [ 2 \ ] . <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> . | #21567 For LR(0) grammars, our algorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\].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. | |
| 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. | |
| tech,16-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 . | #21499 For non-LR grammars the time-complexity of our parser is cubic if the functions that constitute theparser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. | |
| tech,6-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> . | #21573 Extended CF grammars (grammars withregular expressions at the right hand side) can be parsed with a simple modification of the LR-parser for normal CF grammars. | |
| tech,23-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> . | #21590 Extended CF grammars (grammars with regular expressions at the right hand side) can be parsed with a simple modification of theLR-parser for normal CF grammars. | |
| tech,8-5-E91-1012,ak | For <term> LR ( 0 ) grammars </term> , our <term> algorithm </term> is closely related to the <term> recursive ascent parsers </term> recently discovered by Kruseman Aretz \ [ 1 \ ] and Roberts \ [ 2 \ ] . | #21540 For LR(0) grammars, ouralgorithm is closely related to the recursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\]. | |
| tech,7-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 . | #21490 For non-LR grammars the time-complexity of ourparser is cubic if the functions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. | |
| 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 ofLR-parsers is given, together with a simple correctness proof. | |
| other,4-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 . | #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,11-4-E91-1012,ak | <term> Memo-functions </term> also facilitate a simple way to construct a very compact <term> representation </term> of the <term> parse forest </term> . | #21526 Memo-functions also facilitate a simple way to construct a very compactrepresentation of the parse forest. | |
| other,5-2-E91-1012,ak | It is presented as a <term> generalization </term> of the <term> recursive descent parser </term> . | #21476 It is presented as ageneralization of the recursive descent parser. | |
| tech,14-5-E91-1012,ak | For <term> LR ( 0 ) grammars </term> , our <term> algorithm </term> is closely related to the <term> recursive ascent parsers </term> recently discovered by Kruseman Aretz \ [ 1 \ ] and Roberts \ [ 2 \ ] . | #21546 For LR(0) grammars, our algorithm is closely related to therecursive ascent parsers recently discovered by Kruseman Aretz \[1\] and Roberts \[2\]. | |
| 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 thefunctions that constitute the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. | |
| other,23-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 . | #21506 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. |
