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

Describe two common idioms in context-free grammars that cannot be parsed top-down.
Create a context-free grammar that is equivalent to N.
Topic: Parsing Problem 2. Consider the following context-free grammar What is the language L described by the grammar? Compute the first sets for S, X, and Y. You must show the iterations of the algorithm separately Compute the follow sets for S, X, and Y. You must show the iterations of the algorithm separately Construct the LL(1) parsing table for the grammar. It is enough to just show the table Show the steps in parsing the strings from L
1a. Fill out the following blanks to make it a context-free grammar for the given language over the alphabet {a, b}: 1b. Fill out the following blanks to make it a context-free grammar for the given language:
What is the name of the property of a grammar when the same string can be produced by that grammar in more than one way
Design a DFA for a and c a) All words on Σ = {?, ?} that the last two letters are different. Example: ?????, ????? c) All words on Σ = {0, 1} that the remainder of the represented binary number by 8 is 5. Convert the DFAs you designed in part a and c of the first question to an equivalent regular grammar.
Write a context-free grammar for the language {dmcma"b"bªdª | m, n, q 2 3 }. Use as few variables as possible.
part 4 and 5
Why do compilers employ parsing techniques that only work with a subset of all grammars?
IV) Write derivations for four strings of various lengths and describe what is the language generated, L(G) by the following grammar G. V = {S, A, B}, T = {a,b} P=SA, SB, BbB, AaA, A → A, B1, S is the start nonterminal. V) Write derivations for four strings of various lengths and describe what is the language generated, L(G) by the following grammar SaSaa|B, B→ bB|X
3) To enforce the right associativity for a math operator in grammar, what property must production rules associated with that operator have? Choose one of the following options: a) Right recursive b) Left recursive c) Any form of recursion d) No recursion
What do you call the operation that begins at the start symbol of a grammar, runs a series of productions, and terminates with a string that cannot be further expanded?