please answer all the three parts of the above question, because
these are related to each other, i can't post them separately, its
a short question . please solve as soon as possible. i need them as
soon as possible...
Question 6. Let G be the context-free grammar with S and T as its non-terminals (S being the starting non- terminal), I ={a.b} as its alphabet, and the following production rules: SaSa|T, Tb7bb2 (a) Give the definition of L(G). A definition of L(G) in "precise" English is acceptable. [2 marks] (b) Is this an LL(1) grammar? Why? [2 marks] (c) Construct a PDA M such that L(M)=L(G) using the conversion from a CFG to a PDA procedure (as in Chapter 7 on Parsing of the Lecture Notes). [3 marks] a
Question 6. Let G be the context-free grammar with S and T as its non-terminals (S being the starting non- terminal), I
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Question 6. Let G be the context-free grammar with S and T as its non-terminals (S being the starting non- terminal), I
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!