Xref: utzoo comp.theory:1778 comp.compilers:1889
Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!elroy.jpl.nasa.gov!decwrl!world!iecc!compilers-sender
From: markjan@cs.kun.nl (M.J. Nederhof)
Newsgroups: comp.theory,comp.compilers
Subject: Can unambiguous grammars be parsed in linear time?
Keywords: parse, theory
Message-ID: <2922@wn1.sci.kun.nl>
Date: 5 Apr 91 14:23:53 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: markjan@cs.kun.nl (M.J. Nederhof)
Organization: University of Nijmegen, The Netherlands
Lines: 8
Approved: compilers@iecc.cambridge.ma.us

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.