Question: Please i need help with this question 1. (10 pt) (Grammar and strings) Given a string 010#0101 and the context free grammar G: S AB

Please i need help with this question 1. (10 pt) (Grammar

Please i need help with this question

1. (10 pt) (Grammar and strings) Given a string 010#0101 and the context free grammar G: S AB A 0A01A1 #B BOB1B (a) (2 pt) What are the terminals and non-terminals of the grammar? (b) (2 pt) Give a leftmost derivation for the string. (C) (2 pt) Give a rightmost derivation for the string. (d) (2 pt) Give a parse tree for the string . (e) (2 pt) Write 2 strings that do not belong to the language L(G) but use only the terminals from LG)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Please i need help with these question E E or T ror and T E 1 T F | 0 not T not T 1 F 1 zor F 1 0 T 1 F 1 1 F 1 0 4. (10 pt) Designing Grammar) Design CFGs for the given languages: (a) (3 pt) Write a...

A discrete sequence {xn} can be converted into a continuous representation x(t) = ts X n= (t n ts) xn, where ts is the sampling period. (a) State two characteristic properties of Dirac's function. [2...

In this question you will be asked to reflect on a project you have been involved in or observed, in which a design evolved, or could have evolved, through applying a theory of user behaviour. You...

Let A, B be sets. Define: (a) the Cartesian product (A B) (b) the set of relations R between A and B (c) the identity relation A on the set A [3 marks] Suppose S, T are relations between A and B, and...

dee complete please help Complexity Theory (a) Defifine the set of Boolean expressions 2CNF and the language 2SAT over them. (b) For a Boolean expression in 2CNF, let G() be the directed graph with...

ttth Suppose that the sequence of bags {Bn | n N} is recursively enumerated by the computable function e(n, x) = fn(x), [7 marks] Hence prove that the set of all recursive bags cannot be recursively...

"Fortran, Algol and Lisp invented most programming language concepts 50 years ago; adding the concept of object-orientation suffices to explain all programming languages to date". To what extent is...

This question concerns lexical grammars. (a) Tree Adjoining Grammars contain two types of elementary tree. (i) What are these trees called? [1 mark] (ii) If one were building a grammar for English...

Consider the trigonometric series a0 2 + X r=1 (ar cos rx + br sin rx) where a0, a1, a2, . . . and b1, b2, . . . are constants and suppose that f(x) is a periodic function of x with period 2. (a)...

Make sense of the thoughts of static and dynamic chains, giving an illustration of a circumstance in which they contrast (for example reference to some unacceptable one would get to the wrong...

Do you know what services accountants do beyond auditing and tax services? Of course, the normal services or the accounting engagements we most hear about are audits and tax services. As professional...

1. What type(s) of controls is (are) Mr. Edens using to ensure high worker productivity? Give examples and label the controls. As you label the controls, use the types of controls discussed in the...

Singapore welcomes thousands of Australian visitors each month. Monthly data from February 2016 to July 2017 are contained in . a. Plot the data. b. Calculate a linear trend forecasting...

Seved Help 14 Wisconsin Snowmobile Corp. is considering a switch to level production Cost efficiencies would occur under level production, and aftertax costs would decline by $31,500, but inventory...

6. Have the trainees do the entire task and praise them for correct reproduction.

3. Explain the key points or behaviors. (Write out the key points for the trainees, if possible.)

5. Have the trainees do one or more single parts of the task and praise them for correct reproduction (optional).