<Li> accept, which is written as' acc' and indicates that the parser accepts the string in the input stream . </Li> <P> The goto table is indexed by a state of the parser and a nonterminal and simply indicates what the next state of the parser will be if it has recognized a certain nonterminal . This table is important to find out the next state after every reduction . After a reduction, the next state is found by looking up the goto table entry for top of the stack (i.e. current state) and the reduced rule's LHS (i.e. non-terminal). </P> <P> The table below illustrates each step in the process . Here the state refers to the element at the top of the stack (the right-most element), and the next action is determined by referring to the action table above . Also note that a $is appended to the input string to denote the end of the stream . </P> <Table> <Tr> <Th> State </Th> <Th> Input stream </Th> <Th> Output stream </Th> <Th> Stack </Th> <Th> Next action </Th> </Tr> <Tr> <Td> 0 </Td> <Td> 1 + 1 $</Td> <Td> </Td> <Td> (0) </Td> <Td> Shift 2 </Td> </Tr> <Tr> <Td> </Td> <Td> + 1 $</Td> <Td> </Td> <Td> (0, 2) </Td> <Td> Reduce 5 </Td> </Tr> <Tr> <Td> </Td> <Td> + 1 $</Td> <Td> 5 </Td> <Td> (0, 4) </Td> <Td> Reduce 3 </Td> </Tr> <Tr> <Td> </Td> <Td> + 1 $</Td> <Td> 5, 3 </Td> <Td> (0, 3) </Td> <Td> Shift 6 </Td> </Tr> <Tr> <Td> 6 </Td> <Td> 1 $</Td> <Td> 5, 3 </Td> <Td> (0, 3, 6) </Td> <Td> Shift 2 </Td> </Tr> <Tr> <Td> </Td> <Td> $</Td> <Td> 5, 3 </Td> <Td> (0, 3, 6, 2) </Td> <Td> Reduce 5 </Td> </Tr> <Tr> <Td> 8 </Td> <Td> $</Td> <Td> 5, 3, 5 </Td> <Td> (0, 3, 6, 8) </Td> <Td> Reduce 2 </Td> </Tr> <Tr> <Td> </Td> <Td> $</Td> <Td> 5, 3, 5, 2 </Td> <Td> (0, 3) </Td> <Td> Accept </Td> </Tr> </Table>

The value of k in lr(k)cannot be