Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| 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) |
| From: | Chris F Clark <cfc@shell01.TheWorld.com> |
| Newsgroups: | comp.compilers |
| Date: | 13 Jun 2004 11:18:04 -0400 |
| Organization: | The World Public Access UNIX, Brookline, MA |
| References: | 04-06-038 |
| Keywords: | parse, LALR |
| Posted-Date: | 13 Jun 2004 11:18:04 EDT |
Many languages are in the 200-500 state range--I've never counted
transitions, so I can't answer that part of your question (that's more
than 400 transitions per state, so I'm a little concerned there, but
not much). If you are parsing multiple dialects, it would not be
surprising for the number of states to be more than that. If you were
getting more than 1k states, I'd be a little concerned that something
was amiss. Unfortunately, number of states does not rise linearly
with number of rules, so the numbers quickly blossom as one adds
complexity (e.g. overlapping dialects).
Hope this helps,
-Chris
*****************************************************************************
Chris Clark Internet : compres@world.std.com
Compiler Resources, Inc. Web Site : http://world.std.com/~compres
23 Bailey Rd voice : (508) 435-5016
Berlin, MA 01503 USA fax : (978) 838-0263 (24 hours)
------------------------------------------------------------------------------
Return to the
comp.compilers page.
Search the
comp.compilers archives again.