LR sets and parser =======Consider the following grammar describing Lisp arithmetic. Since all symbols are single characters, spaces have been omitted for compatibility with our input specifications for programming exercises 4 to 7 S -> E // S is start symbol, E is expression E -> (FL) // F is math function, L is a list L -> LI | I // I is an item in a list I -> n | E // an item is a number n or an expression E F -> | - | * | * Find FIRST, FOLLOW and LR(0) sets for this grammar. Is the grammar LR(0)? Is it SLR?
