Consider a grammar defined by the following rules, where S, U, and V are non terminals, a, b, and care terminals, and e stands for the empty string: S => U U => b c U U => a V V => a V V => e a. What type of grammar is this in the Chomsky hierarchy? What kind of language does it generate (what do the strings it produces look like)? b. Draw the production (parsing) tree for the string b c b c a a. c. Which of the following strings are correct from the point of view of the grammar and which ones are not? bcabca b c b ca a a ab ca b c b c b c

Consider a grammar defined by the following rules, where S, U, and V are non terminals, a, b, and care terminals, and e stands for the empty string: S => U U => b c U U => a V V => a V V => e a. What type of grammar is this in the Chomsky hierarchy? What kind of language does it generate (what do the strings it produces look like)? b. Draw the production (parsing) tree for the string b c b c a a. c. Which of the following strings are correct from the point of view of the grammar and which ones are not? bcabca b c b ca a a ab ca b c b c b 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 the language generated by the following grammar. Sbs I aA le A aA I bBlb B-bS
Provide the rules for context-free grammars that generate the following languages. L4 = {w ∈ {a, b, c} | |w| ≥ 3, |w| is odd, and the first symbol, middle symbol and last symbol of w are all different }
find the context-free grammar that represents the language that is accepted by this given PDA
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 is attached
A | B | C + | Show the grammar is ambiguous (hint: parse trees):
Solve number 10
Give a context-free grammar for the following languages: R a. L₁ = {a" ww²b"; w € *, n bª; w € Σ*, n ≥ 0} ; Σ = {a,b} b. L₂ = {anbmck; n = morm ≤k; n, m, k ≥ 0}; E = {a,b,c} {a¹
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).
1. Convert the following regular grammar into a Finite Automata S➜X XXXIXY YYYYZ 2 → 22 | 2 2. Convert the previous problem to a regular expression. 3. Write a grammar that generates an even number of X's.
The set of all syntactically valid strings representing regular expressions is A. a regular language, because a regular expression can describe this language B. a context-free language and it can be generated by a context-free grammar but not by any regular grammar O C. a context-sensitive language but not by any context-free grammar
Please please solve the question in picture .