Question: Let G = ({S, A}, sigma, R, S) be the context-free grammar with sigma = {a, b} and rules R = S rightarrow SS |

Let G = ({S, A}, sigma, R, S) be the context-free

Let G = ({S, A}, sigma, R, S) be the context-free grammar with sigma = {a, b} and rules R = S rightarrow SS | ASa | aA, A rightarrow bA | SAa | a. And let T be the language of strings x such that #a(x) is even. (a) Show that this grammar is unsound for T-that is, find a string in L(G)\T. (b) Change one of the rules to make a grammar G' that is sound for T. Make it a "single-edit" change: that is, inserting, deleting, or changing just one character (terminal or variable symbol). Then explain why your new G' is sound. (c) Is the original grammar comprehensive for T? OK, it's not: elementof elementof \L(G). So let's change the target language to be T' = T\{elementof}and revise the question: Is the original grammar comprehensive for T'? If you say yes, argue why as best you can; if you say no, give a nonempty string with an even number of a's that G does not generate, and explain why not. Let G = ({S, A}, sigma, R, S) be the context-free grammar with sigma = {a, b} and rules R = S rightarrow SS | ASa | aA, A rightarrow bA | SAa | a. And let T be the language of strings x such that #a(x) is even. (a) Show that this grammar is unsound for T-that is, find a string in L(G)\T. (b) Change one of the rules to make a grammar G' that is sound for T. Make it a "single-edit" change: that is, inserting, deleting, or changing just one character (terminal or variable symbol). Then explain why your new G' is sound. (c) Is the original grammar comprehensive for T? OK, it's not: elementof elementof \L(G). So let's change the target language to be T' = T\{elementof}and revise the question: Is the original grammar comprehensive for T'? If you say yes, argue why as best you can; if you say no, give a nonempty string with an even number of a's that G does not generate, and explain why not

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!

Using the following balance sheet items and amounts, calculate the total liquid assets and total current liabilities. a. Total liquid assets $ b. Total current liabilities $ Money market account,...

= (3) Let G ({S, A}, , R, S) be the context-free grammar with = {a,b} and rules R = S SS | ASa | aA, A bA | SAa | a. And let T be the language of strings such that #a(r) is even. (a) Show that this...

Let G be a context-free grammar on alphabet = a, +, and the} following production rules: (a) (5 points) Specify the parse tree and left-most derivation each of the strings "((a))" and "(a+a* a) *...

Let G = ({S, A, B, C, D}, sigma, R, S) be the context-free grammar with sigma ={a, b} and rules R = S rightarrow AD | bbC | SaBS A rightarrow BAB | elementof B rightarrow SB | b C rightarrow ACD | BA...

Recall that a context-free grammar in normal form is a 4-tuple(V, sigma, R, S)where (a) V is a finite set called the variables. (b) sigma is a finite set, disjoint from V, called the terminals. (c) S...

Recall that a context-free grammar in normal form is a 4-tuple (V, sigma, R, S) where (a) V is a finite set called the variables. (b) sigma is a finite set, disjoint from V, called the terminals. (c)...

Show that L = {w element of {0, 1}*: w contains at least two 0s and at most one 1} is regular by providing: a) Deterministic Finite Automaton that accepts it Regular Expression that generates it. Let...

Consider the following construction that converts a DFA, M = (Q, sigma, delta, q_0, F), to a context-free grammar, G = (V, sigma, R, S): V = {V_i\q_i Q}. That is, we make a separate variable V_i for...

Consider the following construction that converts a DFA, M = (Q, sigma, delta, q_0, F), to a context-free grammar, G = (V, sigma, R, S): V = {V_i|q_i elementof Q}. That is, we make a separate...

I just need part (a) for this problem Consider the context-free grammar G = (V, sigma, R, S), where V = {a, b, S, A, B), sigma = {a, b}, R = {S rightarrow aB, S rightarrow bA, A rightarrow y a, A...

Consider the following construction that converts a DFA, M = (Q, Sigma, delta, q_0, F), to a context-free grammar, G = (V, Sigma, R, S): V = {V_i|q_i element Q}. That is, we make a separate variable...

Princeton Drycleaners has capacity to clean up to 5,000 garments per month. Requirements 1. Complete the following schedule for the three volumes shown. 2. Why does the average cost per garment...

You have been presented with an office building for sale for $115 psf. The building is 240,000 sf. There is one tenant in place who leases 50% of the building at a full-service rental rate of $25.00...

Typical learning percentages range between _ _ _ _ _ _ _ _ _ _ blank percent. Multiple Choice 7 0 and 9 0 6 0 and 8 0 7 5 and 9 5 6 5 and 8 5 8 0 and 9 0

Compared with half a century ago, adoption has become _ _ _ _ _ _ _ _ _ common, but it is more open and acceptabl e , so we probably discuss it _ _ _ _ _ _ _ . fill in the blanks more or much less or...

How do modern Dashboards differ from earlier implementations?

Provide an example of a descending Hierarchy of Data Validation/Lookup Tables.

In a HCM Database, how does applying Relational Design and Third Normal Form rules avoid duplication of Job Title storage in each employee base record?