Which of the following regular grammars generates the same language as the regular expression a(b + c)(d)? Assume that the starting symbol is S and that unit productions are allowed. OS a A A → bA | CA | D D → dD | H H→ A OS → aA AbS cS D DdS H H→ A OS→ aA A → bA CA A → dA | A OS A a A bA cA bD cD DdD dH 1 H→ A

Which of the following regular grammars generates the same language as the regular expression a(b + c)(d)? Assume that the starting symbol is S and that unit productions are allowed. OS a A A → bA | CA | D D → dD | H H→ A OS → aA AbS cS D DdS H H→ A OS→ aA A → bA CA A → dA | A OS A a A bA cA bD cD DdD dH 1 H→ A

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

Consider the context-free grammar below that generates mathematical expressions (it uses "a" as a placeholder for where values would go). S' → S$ S→ BA A→+BA|-BA|A В > DC C→ *DC | /DC |1 D→ a|(S) The non-terminals in this grammar are S', S, A, B, C, and D. The terminals are a, +, -, *, /, (, ), and $. For grading purposes, list terminals in your answers in the following order: a+-*/()$ For each production, list which next input symbol would predict the production (assuming that the production's left-hand side is on the top of the parsing stack). You should find your answer by building a prediction table as seen in class. In each answer list your set in the order given above. If a set is empty write exactly the word empty. Separate items using commas and no spaces. For example: a,-,/,) S → BA { A→ +BA { } A→ -BA { A→1{ В > DC { } C→ *DC { C→ /DC { C → { D→a|(S) { D→ (S) {
1. Construct a Context Free Grammar that only accepts strings maintaining the following property: L = {0n1n | n ≥ 0} [3] 2. Begin with the following grammar: S → ABS| b A → aAS | ε B → SbS | Aa | bb | Dccc
1. Show that following grammars are ambiguous (or not ambiguous) a. S → aSS S → b
Question 1 (max. 5 minutes) What is the equivalent regular expresiion of the following context free grammar? S- bxa X → ax | bX | € Your answer: O aba*b O ba*a O a(a U b)*b O b(a U b)*a O ab*b
Language L S->A | AX X->ABY | AB Y->ABCY | ABC BA -> AB CA -> AC CB -> BC A->a B->b C->c Draw a state diagram for a linear-bounded automata that accepts L.
3
What are the drawbacks of using assembly language for non-specialist programming tasks? Is there ever a time when you'd recommend using assembly language?
What language is generated by the following grammar? It is an unrestricted grammer. Briefly explain. S → aSBC | D BC → CB CB → BC B → b C → c D → dD | d
Provide the rules for context-free grammars that generate the following languages. L3 = {w ∈ {0, 1} | n0(w) ≥ 2, and n1(w) is odd}
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.
Q1-Consider the following grammar: → a c | → C | C → d Which of the following sentences are in the language generated by this grammar? a. abcd b. acccbd с. ассcbcc d. accd е. сС
Computer Science