Define what one might mean by properly nested parenthesis structures involving two kinds of parentheses, say (() and []. Intuitively, properly nested strings in this situation are ([]), ([[]D[O], but not ([)] or ((]]. Using your definition, give a context-free grammar for generating all properly nested parentheses.

Define what one might mean by properly nested parenthesis structures involving two kinds of parentheses, say (() and []. Intuitively, properly nested strings in this situation are ([]), ([[]D[O], but not ([)] or ((]]. Using your definition, give a context-free grammar for generating all properly nested parentheses.

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

Give the descriptive definition of the language generated by the following grammar. Draw thecorresponding total language tree. S → ab | aXXX → bb | a
1)Let G = (V, ∑, R, S) be a grammar with V = {S, H, Gm J}; ∑ = {h, g, j}; and the set of rules: S → H H → h | hJG G → Gg | Sg | HgJ J → jH | HHJ| Jj a)Convert this grammar to a PDA using the method we described. b)Convert G to Chomsky normal form.
Construct an unambiguous grammar equivalent to the grammar in S→AB|aaaB, A→a|Aa, B→b.
1. Consider the grammar with productions S -> aABb, A -> bB, B -> A | λ. (a) Give a leftmost derivation of the string abbb. (b) Draw a derivation tree that yields the string abbb. (c) Prove that the grammar is ambiguous by providing a different leftmost derivation of the string abbb from that you give in (a)
Derive left and right most derivations for the input string a=b* c + d\e for the given grammar ?
Consider the context-free grammar G = (V, T, S, P), where V = {S, A}, T = {a, b}, and P consists of S → aSb | aAb, A → aA | λ. a. Show the derivation tree resulting from top-down parsing of the string aaaabb. b. Show the leftmost derivation of the string aaaabb.
4. Given the following grammar: S → AB | aB A → abb | λ B → bbA (a) Simplify the grammar rules by removing any l-productions, unit-productions, and useless productions. (b) Convert the grammar in (a) into Chomsky normal form. (c) Convert the grammar in (a) into Greibach normal form.
Q) Identify whether the given grammars are ambiguous or not with help of parse tree and convert each grammar to CNF format a) S → SAB | ∈ A → AaB | a B → AS | b b) S → aSSS → b This question is from Theory Of Automata Subject.
Find a CFG that generates the language : L = {a ibj c jd i : i, j ≥ 1} and Transform the grammar of the previous exercise into a CFG in Normal Form of Chomsky
Show that the following grammar is ambiguous – show two distinct parse trees for one terminal string. E? E + E | id
Let G be a grammar with the start variable S and with the following Rules governing a language above the alphabet Σ ={0,1} describes Subtask (d) (i) Sketch a procedure by which one can speak the language L (G) clearly can enumerate more skillfully (e ciently). (ii) Outline a process by which one can use the complement of the language L (G) skillfully (e ciently) can enumerate.
Eliminate all useless productions from the grammar S → aS|AB|λ, A → bA, B → AA. What language does this grammar generate?