| 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 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. | |
| 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 the parser are implemented as memo-functions, i.e. functions that memorize the results of previous invocations. |
