1-1) Eliminate left recursion in the following grammar: A -> Bx | By B -> BBy | Bx | x C-AC|XCA 1-2) explain the reason

[answerhappygod]

1 1 Eliminate Left Recursion In The Following Grammar A Bx By B Bby Bx X C Ac Xca 1 2 Explain The Reason 1 (34.74 KiB) Viewed 37 times

1-1) Eliminate left recursion in the following grammar: A -> Bx | By B -> BBy | Bx | x C-AC|XCA 1-2) explain the reason success or fail about 1-1 1-3) A -> Bx | x B -> Cy C -> Az | z 1-4) A BxB B -> AyA | BxB 2) Find closed terms F such that (1) Fxy->> Bx|yk (2) F xy -»> ß x(F x) (3) Fx -»> ß F (4) F F x -»> ß FFF 3) Determine for each A-term whether it has a B-normal-form or not. If some term has a B- normal-form, then show (write) this B-normal-form. (1) (Ax.x) (Ax.x) (Ax.x) (^x.x) (2) (λχ.xy)Ω (3) K(K) 22) 0 (4) (Az.((1 z)(Iz)))(xx.xxx) (5) Ⓒ(XX.K x K) (6) (xx.z.y(z))) (Axz) 4) Output values of f[2,5,8]. f xs -> case of xs D -> [1] yys >y:y:f(ys) ++ [y]