Based on the code of small compiler you did in project, modify it by using LR Parser technique. Fig.1 Model of an LR parser. INPUT . S STACK!.. LRPasing-OUTPUT Program action goto First, you need to build the action and goto tables for the grammar in project 2. The parser algorithm is Input: An input string w and an LR parsing table with function action and goto for a grammar G. Output: If w is in I(G), a bottom-up parse for w otherwise, an error indication. Set ip to point to the first symbol of ws repeat forever begin let s be the state on top of the stack and a the symbol pointed by ip: action [s, a]-shift sthen begin push a then s' on top of the stack advapce ip to the next input symbol; end else if action [s, a1-reduce A--> then begin pop 2.1 | symbols off the stack; let s' be the state now on top of the stack; e.@+1 Based on the code of small compiler you did in project, modify it by using LR Parser technique. Fig.1 Model of an LR parser. INPUT . S STACK!.. LRPasing-OUTPUT Program action goto First, you need to build the action and goto tables for the grammar in project 2. The parser algorithm is Input: An input string w and an LR parsing table with function action and goto for a grammar G. Output: If w is in I(G), a bottom-up parse for w otherwise, an error indication. Set ip to point to the first symbol of ws repeat forever begin let s be the state on top of the stack and a the symbol pointed by ip: action [s, a]-shift sthen begin push a then s' on top of the stack advapce ip to the next input symbol; end else if action [s, a1-reduce A--> then begin pop 2.1 | symbols off the stack; let s' be the state now on top of the stack; e.@+1