Register

Ullman(Second Edition) Exercise 4.2.3. Question (a) (page no-207)

647 views
0 votes
0 votes
Design grammar for the language-

set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1

 

is this correct?

S->A | 01S

A->1AS | ε
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

471
views
0 answers
0 votes
admin asked Aug 17, 2019
471 views
Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 3 (Page No. 207)
Design grammars for the following languages:The set of all strings of $0's$ and $1's$ such that every $0$ is immediately followed by at least one $1$.The set of all strings ... $xy$, where $x\neq y$ and $x$ and $y$ are of the same length.
User Avatar
786
views
0 answers
1 votes
admin asked Aug 17, 2019
786 views
Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 2 (Page No. 206 - 207)
Repeat Question $4.2.1$ for each of the following grammars and strings: $S\rightarrow 0S1\mid 01$ with string $000111$ ... bfactor\mid bfactor$bfactor\:\rightarrow\:not\:bfactor\mid (bexpr)\mid true\mid false$
User Avatar
499
views
0 answers
0 votes
admin asked Aug 17, 2019
499 views
Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 4 (Page No. 207 - 208)
There is an extended grammar notation in common use. In this notation, square and curly braces in production bodies are metasymbols (like $\rightarrow$ ... grammar with these extensions can be generated by a grammar without the extensions.
User Avatar
219
views
0 answers
0 votes
admin asked Aug 20, 2019
219 views
Ullman (Compiler Design) Edition 2 Exercise 4.4 Question 10 (Page No. 233)
Show how, having filled in the table as in Question $4.4.9$, we can in $O(n)$ time recover a parse tree for $a_{1}a_{2}\cdot\cdot\cdot a_{n}$. ... , some pair of nonterminals in other table entries that justified putting $A$ in $T_{ij}$.
User Avatar
Link Copied!