Problem 5Consider the following grammar:A ::= z BzB ::= CB|xy y x|eC := DEEDD := x x | x B x| xx B | BxxE := y y|y By y y B| Byywhere x, y, and z are terminals for letters x, y, and z respectively. Define in English the language that thegrammar generates and explain why so

In English the language that gives grammar generated

Answered: Problem 5 Consider the following…

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

1. Convert the following regular grammar into a Finite Automata S➜X XXXIXY Y➜yylyz 2-22 12 2. Convert the previous problem to a regular expression. 3. Write a grammar that generates an even number of X's.
Construct a context free grammar which generates the same language the following PDA accepts. Explicitly state what the start symbol of your grammar is. 1 d,x-E E,ε→$ a,ε-x 4 2 b,ε-x f,x->E ε, $→E C,X→E LO 5 3
Computer Science Consider the following context-free grammar G: S → XyX X → YYY X → Z Y → xY Y → ε Z → zZ Z → z Convert G to Chomsky normal form. It is not sufficient simply to write down the final result.
Problem #6: Show that the following grammars are ambiguous by demonstrating two different parse trees and two different left-most derivations for the same terminal string in each case. Also for each case, find an equivalent unambiguous grammar: a) S-SS |a|b b) S-ABA A->aA | E B-bB c
Question 2-Context-free Grammars Consider the alphabet = {A, V., (,), x, y, z) and the following grammar G = (V,E, R, F), defined by the rules: F (FAF) | (FVF) | (F) | P (a) Identify the set of variables and the set of terminal symbols of G. (b) Identify three words (of lengths between 10 and 20) that can be generated by the above grammar and show their derivations. (c) Consider a modified grammar G', where we remove the brackets '(' and ')' from the alphabet and the derivation rules. That is we set Σ'= {A, V., x, y, z) and we remove all occurrences of brackets in the derivation rules. Show that there are words that are derived ambiguously in G'
Question 1 Consider the following grammar S aSb S Sb LI Give a one-sentence description of the language generated by this grammar. 1.2 Show that this grammar is ambiguous by giving a single string that can be parsed in two different ways. Draw both parse trees. 13 Give an unambiguous grammar that accepts the same language as the grammar above.
Problem #6: Show that the following grammars are ambiguous by demonstrating two different parse trees and two different left-most derivations for the same terminal string in each case. Also for each case, find an equivalent unambiguous grammar: c) S-A B A-aAb ab B-abB c
Solve number 10
Problem 4 For each of the following grammars state whether it is ambiguous or unambiguous. If it is ambiguous give an equivalent unambiguous grammar. If it is unambiguous, state all the precedences and associativities enforced by the grammar. Assume Id generates identifiers. a) E = E + F | F F := F + F | Id | (E)
Create a grammar that allows only identifiers that start with a letter, have at least one but no more than three digits, and can include any number of letters. (1) Provide a grammar for such a collection of identifiers, and (2) provide an accepter for such a set of identifiers (production rule).
Please please solve the question in picture .
Construct the FIRST and FOLLOW for the grammar: A → BC | EFGH| H B → b C → c|e E → e|E F» CE G→g H → h|e

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

Problem 5 Consider the following grammar: A := z Bz B :=CB|xyy x|e C:= DEED D:=xx|x B x | xx B|Bxx E ::= yy|y Byly y B| Byy where x, y, and z are terminals for letters x, y, and z respectively. Define in English the language that the grammar generates and explain why so.