Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [9 earlier articles] |
| Re: regular expression operators in CF grammars parsersinc@yahoo.com (SLK Parsers) (2002-06-28) |
| Re: regular expression operators in CF grammars soenke.kannapinn@wincor-nixdorf.com (=?Windows-1252?Q?S=F6nke_Kannapinn?=) (2002-06-28) |
| Re: regular expression operators in CF grammars cfc@world.std.com (Chris F Clark) (2002-07-02) |
| Re: regular expression operators in CF grammars cfc@world.std.com (Chris F Clark) (2002-07-02) |
| Re: regular expression operators in CF grammars joachim_d@gmx.de (Joachim Durchholz) (2002-07-02) |
| Re: regular expression operators in CF grammars soenke.kannapinn@wincor-nixdorf.com (=?Windows-1252?Q?S=F6nke_Kannapinn?=) (2002-07-04) |
| Re: regular expression operators in CF grammars parsersinc@yahoo.com (SLK Parsers) (2002-07-04) |
| Re: regular expression operators in CF grammars rboland@unb.ca (Ralph Boland) (2002-07-04) |
| Re: regular expression operators in CF grammars cfc@world.std.com (Chris F Clark) (2002-07-15) |
| Re: regular expression operators in CF grammars kgw-news@stiscan.com (2002-07-21) |
| Re: regular expression operators in CF grammars nospam@snafu.de (Sönke Kannapinn) (2002-08-10) |
| Re: regular expression operators in CF grammars nospam@snafu.de (Sönke Kannapinn) (2002-08-10) |
| Re: regular expression operators in CF grammars cfc@shell01.TheWorld.com (Chris F Clark) (2002-08-23) |
| [3 later articles] |
| From: | "SLK Parsers" <parsersinc@yahoo.com> |
| Newsgroups: | comp.compilers |
| Date: | 4 Jul 2002 23:18:51 -0400 |
| Organization: | Parsers Inc. |
| References: | 02-05-142 02-05-151 02-06-024 02-06-056 02-06-083 02-07-017 |
| Keywords: | parse |
| Posted-Date: | 04 Jul 2002 23:18:50 EDT |
> > Would you be surprised to learn that 4 of 22 grammars were
> > misclassified in the Ph.D. thesis on which one of these tools was
> > based?
>
> I find this rather surprising. Are you sure that the grammars didn't
> use special extensions that took them beyond their normal class?
> (E.g. ANTLRs lookahead mechanism, which essentially allows one to
> annotate an LL grammar with (hopefully equivalent) LR stuff to guide
> the production selection.)
The original grammars were processed to remove all but the EBNF
notational extensions before they were analyzed. I should have made it
clearer that I wonder if the EBNF contributed to the
misclassification. The errors were not subtle. Two strong LL(2)
grammars (S18, S20) were classified as not SLL(3). Two ambiguous
grammars (S2, S11) were classified as LL(1).
http://parsers.org/slk
Return to the
comp.compilers page.
Search the
comp.compilers archives again.