Design a CFG which recognizes the language L={ w | all the letters on the first half of w are the same, and thesecond half is a substring where no consecutive letters are the same} over the alphabet I=(0,1,2}. Explainyour derivation rules.Note: consecutive means two letters which follow each other, " no consecutive letters are the same" meansyou can't repeat letters, so you can't have "00", "11" or "22" on the second half.

- We need to create a Context Free Grammar for the language definition provided.

Answered: Design a CFG which recognizes the…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Here we concern the following given context-free grammar for generating email addresses. A → N@id.N N → N.id | id Some email addresses examples are: id@id.id id.id@id.id id.id@id.id.id id.id.id@id.id.id.id Remove all left recursions in the above given grammar. Please determine the FIRST and FOLLOW sets for all nonterminals in the revised grammar in (1). Using your results from (2), construct the LL(1) parsing table for your updated grammar in (1). To save your time, a part of table is provided with column labels. You will need to provide the necessary row labels and corresponding table entries.
Consider the context-free grammar S → ASA | AA → aA | ab When following the CFG-to-PDA conversion process learned in class, there is only one state in the resulting PDA that has a self-loop. Of all the PDA triples on this self-loop, write the shortest one that contains an "a" or a "b" anywhere in the triple in the box below (if there is more than one shortest, write any of them).
Produce a context-free grammar (CFG) for each of the following lan-guages, assuming Σ = {0,1}:(a) {w |w starts and ends with different symbols}(b) {w |the length of w is an integer multiple of 3}(c) {wwR| i.e., a word followed by that word reversed}
Give a Chomsky normal form grammar for the set A = {w∈{a,b}^+ | #a(w) = #b(w)}. Recall the symbol + means "1 or more copies" as opposed to the * symbol that means "0 or more copies". Here, set A is non-null strings with an equal number of a's and b's.
Consider the ambiguous grammar S → ABS | ABA → aA | λB → bB | λ What is the shortest string in L(S) other than λ that can be used to show the grammar is ambiguous? Write the string without any spaces or quotation marks. Now show the grammar ambiguous by giving two derivations for the string (each derivation should have a particular important property). Give the two shortest derivations you can find, writing the shorter one in the first box. Your derivations should begin with S, end with your chosen string, and only make one substitution per step. Do not include any spaces, quotes, or lambdas in your answer. Use the ">" character to represent the right arrow. For example, S>aSb>ab might be a legal derivation for a string in another language.
Produce a context-free grammar (CFG) for each of the following lan-guages, assuming Σ = {0,1}:(a) {w |w starts and ends with different symbols}(b) {w |the length of w is an integer multiple of 3}(c) {wwR| i.e., a word followed by that word reversed} Note: For 1b and 1c, the start symbol, S, should go to the empty string as an option. Also, I need b and c answered please thank you
Please ASAP, it's important Design a CFG which recognizes the language L={ w | all the letters on the first half of w are the same, and the second half is a substring where no consecutive letters are the same } over the alphabet Σ={0,1,2}. Explain your derivation rules. Note: consecutive means two letters which follow each other, " no consecutive letters are the same" means you can't repeat letters, so you can't have "00", "11" or "22" on the second half.
Produce a context-free grammar (CFG) for each of the following lan-guages, assuming Σ = {0,1}:(a) {w |w starts and ends with different symbols}(b) {w |the length of w is an integer multiple of 3}(c) {wwR| i.e., a word followed by that word reversed} Note: For 1b and 1c, the start symbol, S, should go to the empty string as an option.
Grammar and its application to FractalsLet G=(N,T,P,∑) where ∑ is the start symbol, N = {D}, T = {d, r, l}, andP = {∑→D, D→DrDllDrD, D → d} 1. Give the most specific type of grammar G.2. Show the leftmost derivation sequence of the string drdlldrd, (i.e. When deriving a new sentential form, always replace one Nonterminal at a time and always replace the leftmost Nonterminal)3. Suppose d is an abstraction of a command to draw a straight line of fixed length in the current direction, r is an abstraction of a command to turn right by 60 degrees, and l is an abstraction of a command to turn left by 60 degrees. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure represented by the generated string drdlldrd.4. The string drdlldrdrdrdlldrdlldrdlldrdrdrdlldrd can also be generated. Assuming that you are to start from a point and that the starting direction is to proceed horizontally to the right, show the figure…
Draw an equivalent DFA for the language “All possible strings that has two or three 1’s over ∑ = {0 , 1}” and also write down an equivalent regular expression for the language "All possible strings whose each a is followed by double b’s over ∑ = {a , b}.
This is not a writing assingment but it keeps getting rejected as one. Provide a CFG (context-free grammar) for the following languages (a) w = anb2n ,Σ = {a,b} (b) w: such that w is a palindrome (i.e. w = wR) ,Σ = {a,b,c}. (c) w=aibjck| i, j, k≥0, i+j=k , Σ={a,b,c}.
Consider the grammar G below in the input alphabet {x, y, z, *}, with leading non-terminal S' in rule 1. S'→S $ S → E * F S → F E → x E → z F y F F → E a) Build the LR(1) automaton of grammar G. Is this grammar LR(1)? b) List the LR(1) items in the last automaton state reached (without performing reductions on the last character) when the input is: x* z zx zxy For this question, indicate the lookahead and the top of the stack, it is also necessary to list the states in the same order as the grammar rules. Also, list the lookaheads in the order {?, $, x, y, z, *} c) Check if G is LALR. If so, answer with the number of states eliminated in relation to the previous automaton. If not, answer with -1

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS