Re: A big easy subset of the CFGs

"Salvador Valerio Cavadini" <scavadini@hotmail.com>
24 Jun 1998 00:14:43 -0400

          From comp.compilers

Related articles
A big easy subset of the CFGs mtimmerm@microstara.com (Matt Timmermans) (1998-06-18)
Re: A big easy subset of the CFGs mickunas@cs.uiuc.edu (1998-06-19)
Re: A big easy subset of the CFGs cfc@world.std.com (Chris F Clark) (1998-06-19)
Re: A big easy subset of the CFGs mtimmerm@microstar.no-spam.com (Matt Timmermans) (1998-06-24)
Re: A big easy subset of the CFGs scavadini@hotmail.com (Salvador Valerio Cavadini) (1998-06-24)
Re: A big easy subset of the CFGs clark@quarry.zk3.dec.com (Chris Clark USG) (1998-07-01)
| List of all articles for this month |

From: "Salvador Valerio Cavadini" <scavadini@hotmail.com>
Newsgroups: comp.compilers
Date: 24 Jun 1998 00:14:43 -0400
Organization: Compilers Central
References: 98-06-104 98-06-121
Keywords: parse, errors

Chris Clark wrote:


  >Matt Timmermans asked for,
  >A subset of CFGs bigger then LR(1). In particular, it should
  >include most of what you can do whit LR(1), using characters as
  >terminals.


  ...


  >... No one implements LR
  >parsing tables using Knuth´s canonical parsing algorithm--the
  >resulting tables grow exponentially with grammar size and are simply
  >too big. Most parser generators either restrict themselves to the
  >LALR subset or use a "minimal state"method, spliting then states only
  >when the context proves useful for resolvin conflicts.


The AYACC parser generator enables you to generate a Canonical LR
parser. Yes, the tables are BIGS (in same cases 160 times bigger than
a LALR) but in same cases the AYACC's CLR parsers are usefuls.


AYACC can be found at:http://www.cix.co.uk/~phil-stearns/


  ______________________________________
  Salvador Cavadini
  Santiago del Estero - Argentina
  emails: scavadini@hotmail.com
                                  juanjo@ucseii.edu.ar
  ______________________________________


--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.