<term>
Memo-functions
</term>
also facilitate a simple way to construct a very compact
<term>
representation
</term>
of the
<term>
parse forest
</term>
.
#21526Memo-functions also facilitate a simple way to construct a very compactrepresentation of the parse forest.
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 .
#21487For 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.
