\input zb-basic
\input zb-ioport
\iteman{io-port 00008783}
\itemau{Urbanek, Friedrich}
\itemti{A simple completeness proof for Earley's algorithm.}
\itemso{Bull. EATCS 42, 194 (1990).}
\itemab
Summary: The aim of this note is to present a ``completeness'' proof of Earley's algorithm (Earley's recognizer) which is simpler than that given in $[A/U]$. Our proof uses induction (like that in $[A/U]$), but it avoids the definition of the notions ``instance'' and ``rank of an instance'' and is so shorter and more direct.
\itemrv{~}
\itemcc{}
\itemut{Earley's algorithm}
\itemli{}
\end