STATE CLOSURE GOTO

c d $ S c
0 S3 S4 1 2

1 accept

2 S3 s4 5

3 S3 s4 6

4 R3 R3 R3

5 R1 R1 R1

6 R2 R2 R2

The and (.) production

I1 S’->S (Augumented grammar {1,$}=accept)

I4 c->d (R3) follow(c) ={c,d,$}

I5 S->cC. (R1) follow(c) ={c,d,$}

I6 c->cC. (R2) follow(c) ={c,d,$}

String recognition w=cdcd

Stack input buffer Action

STACK INPUT BUFFER ACTION

0 Cdcd$ S3

0 c3 Dcd$ S4

0 c3 d4 Cd$ R3C->d

0c3c6 Cd$ R2 C->cC

0c2 d$ S3

0c2c3 d$ S4

0c2c3d4 $ R3 C->d

0c2c5 $ R’ S->cC

05 $ Accept