# LR(1) Parsing

In the middle of a sample LR(1) parsing.

Before LR(1) parsing can take place, first an LR(1) parse table must be defined according to the operations defined here.

The interaction relevant to the parsing of strings in LR(1) parsing is identical to the parsing of strings in LL(1) parsing. See the notes on LL(1) parsing to learn about the interface.

The LR(1) parsing algorithm is, of course, very different from LL(1): the stack is used differently, and the parse is bottom-up rather than top-down as in LL(1) parsing. In addition, when reducing according to a production, the production is highlighted. However, the interface is identical.