2

If there's conflicts, each entry in an LR(0) action table might have one shift, and several reduce actions; while parsing, I imagine it's possible to try all actions by splitting the stack. Does this way of parsing have a name?

ebsddd
  • 1,028
  • 9
  • 20
  • 1
    Your question isn't formulated right. There is an LR parsing algorithm, and LR(0), LR(1), SLR, and LALR(1) parsing tables. – user207421 Aug 15 '14 at 02:40
  • Thank you, sharth and EJP; I wasn't aware of the distinction. I thought GLR had relied on some properties of LALR(1) (I don't quite understand it, yet.) @sharth, if you post your comment as an answer, I'll accept it. Thank you both, again! – ebsddd Aug 15 '14 at 03:03

1 Answers1

2

It sounds like you're interested in a GLR Parser.

Additionally, if you're looking for a parser generator that implements this language, than you might look into Bison.

Bill Lynch
  • 80,138
  • 16
  • 128
  • 173