I am trying to understand stack operation during LL(1) parsing of an input.
In an example, the input has reached the end ie.
$ . Although there are some variables in my stack, they have null production rules under the
$ column in my parse table.
Is it legal to simple pop
ABCD from the stack to reach
$ or must the stack be empty regardless of available production rules when we reach end of input