Re: Regular expression grammar?

Zalman Stern <zalman@netcom18.netcom.com> wrote:

> I sent email to the original poster 'cause I was embarassed to post my
> grammar, but seeing the responses, I think its ok. My main point to the
> poster is that the grammar needs to tell the parser generator how to handle
> the following two cases:
> is "ab|cd" equivalent to "a(b|c)d" or equiv. to "(ab)|(cd)"
> and
> is "ab*" equivalent to "a(b*)" or equiv. to "(ab)*"

    ab}cd is normally (ab)|(cd)
        ab* is normally a(b*)

    and for all concerned a** == a*

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