# jeffreykegler/Marpa-theory

Update for changes to Leo logic

1 parent ca89735 commit 40d245d59fd152751ea624fbc793a88acd7e0c3b Jeffrey Kegler committed Jun 18, 2013
Showing with 4 additions and 4 deletions.
1. +4 −4 recce.ltx
8 recce.ltx
 @@ -1358,17 +1358,17 @@ at a minium, the Earley items, a memoization of the Earley set's location as an integer, and a per-set-list. -Per-set-lists will be described in Section \cite{s:per-set-lists}. +Per-set-lists will be described in Section \ref{s:per-set-lists}. \begin{algorithm}[h] \caption{Marpa Top-level} \begin{algorithmic}[1] \Procedure{Main}{} \State \Call{Initial}{} \For{ $\var{i}, 0 \le \var{i} \le \Vsize{w}$ } -\State \Comment At this point, $\Etable{\var{x}}$ is complete, for $0 \le \var{x} < \var{i}$ +\State \Comment At this point, $\Ves{x}$ is complete, for $0 \le \var{x} < \var{i}$ \State \Call{Scan pass}{$\var{i}, \var{w}[\var{i} \subtract 1]$} -\If{$\size{\Etable{\var{i}}} = 0$} +\If{$\size{\Ves{i}} = 0$} \State reject \Cw{} and return \EndIf \State \Call{Reduction pass}{\var{i}} @@ -1713,7 +1713,7 @@ briefly outlined in both The data structures used are not named in either source, and in this \doc{} they will be called per-Earley set lists'', or PSL's. -PSL's are the subject of Section \cite{s:per-set-lists} +PSL's are the subject of Section \ref{s:per-set-lists}. The resource used by \call{Add EIM Pair}{} is always caller-included.