Re: Ayacc/Aflex "entropy" (P2Ada)

["Robert I. Eachus" <eachus@mitre.org>]

bourguet@my-deja.com wrote:
> Could you post some references to books or web pages or good keywords
> to reduce the space search on the web. All books that I know off which
> speak about parser generators are at the level of LL(1) or simplified
> LR(1) (LALR(1) or other way of reducing the LR tables) except T.J. Parr
> book on PCCTS which describe more how to use PCCTS than its
> "redefinition" of LL(k) and how to use it to build a parser generator.
> Web pages I've found with my naive keyword approaches have not be of
> more use; some buzzwords like OO where added but if they were more than
> buzzwords, it was not clear for me.

    One alternative would be to use a parser generator which uses
Early's algorithm.  Early's algorithm will cheerfully accept any LR(k)
grammar, and parse it quite fast, but it can also accept and recognize
ambiguous grammars, but the performance degrades to O(n**3).
-- 

                                        Robert I. Eachus

with Standard_Disclaimer;
use  Standard_Disclaimer;
function Message (Text: in Clever_Ideas) return Better_Ideas is...