Re: Conflict resolution in EBNF

alexc@world.std.com (Alex Colvin)
20 Oct 2001 21:27:17 -0400

          From comp.compilers

Related articles
Re: Conflict resolution in EBNF csanna@cs.Technion.AC.IL (Anna Nikitin) (2001-10-16)
Re: Conflict resolution in EBNF Soenke.Kannapinn@wincor-nixdorf.com (Snke Kannapinn) (2001-10-20)
Re: Conflict resolution in EBNF alexc@world.std.com (2001-10-20)
Re: Conflict resolution in EBNF knyblad@baan.com (2001-10-20)
Re: Conflict resolution in EBNF cfc@world.std.com (Chris F Clark) (2001-10-20)
Re: Conflict resolution in EBNF friwi@prosun.first.gmd.de (2001-10-20)
Re: Conflict resolution in EBNF dr_feriozi@prodigy.net (2001-10-27)
| List of all articles for this month |

From: alexc@world.std.com (Alex Colvin)
Newsgroups: comp.compilers
Date: 20 Oct 2001 21:27:17 -0400
Organization: The World Public Access UNIX, Brookline, MA
References: <Pine.WNT.4.33.0110141148380.-834121@milton.iecc.com> 01-10-077
Keywords: parse
Posted-Date: 20 Oct 2001 21:27:17 EDT



Anna Nikitin <csanna@cs.Technion.AC.IL> writes:


> 2. Parser doesn't know whether to stop or to continue popping symbols from
>the stack. The conflict appears in the following grammar:
> A -> {a | ab}{b}*


you could handle this like Perl's regular expressions,
using the longest match first unless directed otherwise.
something like
A-> {a|ab}{b}*
vs
A-> {a|?ab}{b}*


as noted in one of the other threads, notation can become unwieldy.


--
mac the naf


Post a followup to this message

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