markjan@cs.kun.nl (M.J. Nederhof) (04/05/91)
We have heard about a theorem which states that unambiguous grammars
can be parsed in linear time.
Does anybody know where this result has been published?
If you have a reference, please send it to:
janos@cs.kun.nl
--
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.