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