a) What is the type of the grammar according to Chomsky hierarchy? Why? b) Find the language generated by the grammar. c) Design another grammar with a more restrictive type that generates the same language you found in (b). (e.g. if the given grammar is Type-1 then design a Type-2 or Type-3 grammar.) d) Is it possible to write a regular expression for the grammar you designed in (c)?

a) What is the type of the grammar according to Chomsky hierarchy? Why? b) Find the language generated by the grammar. c) Design another grammar with a more restrictive type that generates the same language you found in (b). (e.g. if the given grammar is Type-1 then design a Type-2 or Type-3 grammar.) d) Is it possible to write a regular expression for the grammar you designed in (c)?

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.Eliminate left recursion from the production rules that are given in below. E = E + T / T 2.Define context-free grammar. 3.Write down the characteristic of context-free grammar.
A) Write a BNF grammar for the language consisting of strings built only of the letters a and b. The strings may have any number of these letters, but the letter combinations bb must be in each string somewhere, and each string must start with a aa. For example, the strings aaabbabbba, aaaababba, and aababbabb are in the language, while a, bba, ababb, aabaa, and bbaa are not. B) Draw the parse tree for string aabbaaba according to the previous grammar: C) Describe, in complete English sentences and “layman’s terms,” the language defined by the following grammar in BNF (start symbol is <S>):<S> ::= <A>a | <B>b<C> ::= c<A> ::= a<A>a | <C><B> ::= b<B>b | <C>
Q1: Explain the concepts of ambiguity of a grammar. Take an example of your choice and show that the grammar is ambiguous. Draw the parse tree as needed. Q2: Select three flow control statements from C-programming, or from any other programming of your choice, and explain how the relevant grammars are written.
1. Use the algorithm described in class that takes a CFG and converts it into a CNF (Chomsky Normal Form) grammar that generates the same language as the original grammar, except possibly for the string A, to answer the following question. As part of your answer, you should say which variables are nullable, and you should give the appropriate grammar after each step of the algorithm. There are four steps. Give a CFG (context-free grammar) in CNF (Chomsky Normal Form) that generates the same language, except possibly for the string A, as the following grammar: SAB AB →bAa A → aaB bb
a. Eliminate Left Factoring from the grammar above. b. Eliminate Left Recursive from the grammar above if there is any.
arrow_forward Step 1 Context Free Grammar: A formal language that is used to generate all possible strings in a given formal language is called context free grammar. It can be defined as: G=(V, T, P, S) Where G specifies the grammar V specifies the finite set of non-terminal symbols. T specifies the finite set of terminal symbols. P specifies the set of production rules. S specifies the start symbol. The start symbol S is used to derive a string in a context free grammar. It is derived by repeatedly replacing a non-terminal symbol by the right-hand-side production until all the non-terminal symbols have been replaced by the terminal symbols. arrow_forward Step 2 G is a context-free grammar for a language L, and L contains only strings of length 2 or greater. We have to prove that there is a context-free grammar Gd which generates L such that every rule in Gd has the form A -> x1x2, where A is a terminal and each xi is a terminal or a non-terminal. Let the alphabet of…
Topic: Concepts of programming Language Perform the pairwise disjointness test for the following grammar rules. (please give a few details)i. S → aSb|bAAii. A → b{aB}|biii. B → aB|bA
d) Construct a type-3 grammar that derives the L₂ language. (You can use the A- intransitive diagram you found in b.) 5. Let the G, grammar be defined as follows: QILIAH Блязадоля до УТИБАЯ TO G₁VN,VT.P.S> UDAL VN: (S, A, B, CADA ESOSESOE VT: (0,1) P: SOS | 1A A OBAM B➡ OB | 15 | 1 H odmuinsbur2. a) What type of grammar is G₁? b) Construct the FA (finite automaton) model that recognizes the language derived from this grammar and draw the transition diagram.. HOITUD
Give context free grammar for the following :
Describe, in English, the language defined by the following grammar in BNF (start symbol is ):
Backus Naur Form (BNF) is a standard notation for expressing syntax as a set of grammar rules. Figure 1 below shows a grammar for assignment with arithmetic operations, e.g. y = (2*x + 5)*x - 7; assignment => ID = expression ; expression => expression + term I expression - term I term term term * factor | term / factor | factor ( expression ) | ID | NUMBER factor => Figure 1. Grammar (a) Identify and list all the non-terminal symbols in the grammar (b) Identify and list all the terminal symbols in the grammar
I. Represent the Context – free grammar of the following language: L = (anbm I n>=0, m>n) II. Construct a derivation tree of the context – free grammars in Step I above to give the following sets of strings: A. aabbbb B. abb