The Stack Overflow podcast is back! Listen to an interview with our new CEO.

New answers tagged

0

The number of reductions in a parse is strictly dependent on the grammar, since every production must be reduced exactly once. Consequently, all LR parsing algorithms which can parse a given grammar will do so with the same number of reduction steps (and the same number of shift steps). The only moment in the parse where an extra reduction might possibly ...


Top 50 recent answers are included