How to get this to an lalr(1) grammar?

    Hi. I've been trying to figure out how to make a certain grammar
lalr(1). Or at least create an equivalent lalr(1) grammar that parses the
same language. I'm not having much luck with it, so I thought I'd see if
anybody else could figure it out. Here's the grammar as it presently
exists (21 rules):


      s -> c
      s -> s t c


      c -> V n p


      a -> A
      a -> C o


      o -> /* empty */
      o -> A


      t -> T
      t -> D
      t -> a u


      u -> /* empty */
      u -> T


      n -> /* empty */
      n -> L b
      n -> q


      q -> N
      q -> q a N


      b -> /* empty */
      b -> B q


      p -> /* empty */
      p -> P N




    Capital letters denote terminals, lower case letters nonterminals. The
language and grammar are very evidently LR(2). If my understanding is
correct, it should be possible to simplify it to LR(1), perhaps even
LALR(1). I'd appreciate whatever help anybody could give.


    Thanks in advance
>> Mark
--

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