| 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,23-3-E91-1012,ak | <term> memo-functions </term> , i.e. <term> | functions | </term> that memorize the results of previous | #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. |
