Compiler Construction Question

4.4. Parsers and Recognizers 123 foreach p E Prods of the form A [Xi x,] do N NEwNONTERM( ) foreach p E Prods of the form "B . .xm } " do M NEwNoNTERM( ) x," M") Prods Prods U {"Mx, Prods Prods U { M A" } Figure 4.4: Algorithm to transform a BNF grammar into standard form