19. Given the following parser table, state of the stack, and input string, if you were to readi symbol, what action would you take? Tip: Recall th the . represents what we have already read in, and everything AFTER the . represents what we at when representing how much of an input string we've read, everything BEFORE haven't seen yet. State Action Goto S1 2 3 1 R3 R3 R3 2 S4 acc 3 R2 R2 R2 4 Sl input: .id +id $ Stack: 0 A. Add id to the stack, advance the input string so that the . is after the first id symbol, and reduce B. Add id to the stack, advance the input string so that the is after the first id symbol, and C. Add id to the stack, add 1 to the stack, advance the input string so that the . is after the first id D. Add id to the stack, advance the input string so that the is after the first id symbol, reduce by by rule 3. transition to state 1. symbol, and transition to state 1. rule 3, and pop one pair of symbols off the stack