Re: Are lalr parse-tables viable?

A Johnstone <adrian@sartre.cs.rhbnc.ac.uk>
13 Jun 2004 11:17:50 -0400

          From comp.compilers
Related articles
Are lalr parse-tables viable? craig@small-pla.net (craig) (2004-06-11)
Re: Are lalr parse-tables viable? torbenm@diku.dk (2004-06-12)
Re: Are lalr parse-tables viable? adrian@sartre.cs.rhbnc.ac.uk (A Johnstone) (2004-06-13)
Re: Are lalr parse-tables viable? cfc@shell01.TheWorld.com (Chris F Clark) (2004-06-13)
Re: Are lalr parse-tables viable? craig@small-pla.net (craig) (2004-06-21)
Re: Are lalr parse-tables viable? craig@small-pla.net (craig) (2004-06-25)
Re: Are lalr parse-tables viable? cfc@shell01.TheWorld.com (Chris F Clark) (2004-06-28)
| List of all articles for this month |
From: A Johnstone <adrian@sartre.cs.rhbnc.ac.uk>
Newsgroups: comp.compilers
Date: 13 Jun 2004 11:17:50 -0400
Organization: Royal Holloway, University of London
References: 04-06-038
Keywords: parse, LALR
Posted-Date: 13 Jun 2004 11:17:49 EDT

craig <craig@small-pla.net> wrote:


: Like In In The Order Of 327 Unique States And 16258 Transitions Between
: These. (It Is A Little Less If I Use The Non-Lr-Free Version, But Then I Get
: Loads Of Reduce-Reduce Conflicts).


: I Find This Alarmingly Huge!




Doesn't sound out of line to me. If you email me your grammar I will
run it through our tools and explain some of the phenomena that govern
table size to you.


                                                                                                  Adrian
--
Dr Adrian Johnstone, Senior Lecturer in Computing, Computer Science Dep,
Royal Holloway, University of London, Egham, Surrey, TW20 0EX, England.
Email a.johnstone@rhul.ac.uk Tel:+44(0)1784 443425 Fax:+44(0)1784 439786

Post a followup to this message

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