| 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. |
