Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Let G=(V, T, S, P) be the phrase-structure grammar with V= {0, 1, A, S), T = {0, 1) and a set of productions P consisting of S → 1S, S→ 00A, AOA, and A→ 0.

1. Consider the following context-free grammar with start symbol S, nonterminals {S, A, B, C}, and terminals {0,1}: SAO A→B A → C1 B→ 1 B→ E C→ 0 (a) Compute all the sets FIRST and FOLLOW necessary to implement a recursive decent parser for this grammar. However, do not list any unnecessary such a set. (b) Investigate all the combinations of sets FIRST and FOLLOW that are involved in the im- plementation of a recursive descent parser for this grammar. Explain how these com- bination make the grammar suitable or unsuitable (as the case might be) for recursive descent parsing.

Process Programming Contr New Information Machine Networks Modelling Constraint Computational Learning Resor Complexity Proteins Analysis Software Algorithms Engineering Optimisation Model Foundations Constraints Applications Systems Logic Reasoning Dig Theory Data Refinement Games Search Neural Models Inference

Suppose a Prolog database exists that gives information about the parts in an automobile engine. Predicates of big, small, and partof are included.a. Write a query to find all small items that are part of other items.b. Write a query to find all big items that have small subitems.c. Formulate a recursive rule to define componentof.

Let G = (V, T, S, P) be the phrase-structure grammar with V = {0, 1, S}, T = {0, 1}, starting symbol S, and productions S → 0S1 and S → λ. Click and drag statements to show that G generates the set {0n1n | n = 0, 1, 2, ...}.

pls anwser in prolog language, thank you.

Q No. 3: Grammar G1 = ( N = { E, T, F, I, D}, T = { +, *, (, ), 0-9}, S = {E} and P is the set of productions: E E +T | T T T * F | F E) | I DI | D F I D + 0|1|2|3|4 |5 | 6 | 7 | 8 |9 For the string w = (9*(9+9)+999), find- 1. Leftmost derivation 2. Rightmost derivation 3. Parse Tree

a. Convert G to Chomsky Normal Form. b. Convert the language of G to a PDA.

Given the language above, create a context free grammar for L

*Theory of Computation* Question: Give a formal description of the grammar PY. You may assume that the given rules are in a set called RULES Use the last picture to write a formal description