Is there an LR(0) parsing algorithm that handles S/R and R/R conflicts?

Question

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?

Answer 1

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.