Consider the following grammar and LR parse table, and the current stack-content and input- string to be processed

1.

Current Stack Content: 0E1+6T9*7 Current Input: ) $

The Next stack-content and input-string will be:

2.

Current Stack Content: 0F3 Current Input: + id * id $

The Next stack-content and input-string will be:

3.

Current Stack Content: 0 Current Input: id + id * id $

The Next stack-content and input-string will be:

Figure 4.5 Action The LR parsing table for an arithmetic expression grammar Stateid S4 accept R2 S7 1, E E + T 8 2 9 10 6, F-> id 10 R3 R3 R3 R3