menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
My GATE Preparation Experience (AIR 6 in GATE CS 2020) and Tips For Future Aspirants
IIT Madras MS in CSE Interview Experience
My GATE Preparation Experience (GATE CS 2020 AIR 188)
Interview Experience at IITM MS CS 2020
IIT Delhi CSE MS(R) Interview Experience- July 2020
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent Blog Comments
Great Insights :) and Congratulatios
This is really Inspiring, Thanks for sharing :)
Congratulations Arvind. You have prepared in very...
Thank you @gatecse :)
Congrats Aravind :) Don’t just copy...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Ullman(Second Edition) Exercise 4.2.3. Question (a) (page no-207)
0
votes
90
views
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 | ε
theory-of-computation
compiler-design
context-free-grammars
asked
Mar 22, 2019
in
Compiler Design
aditi19
90
views
answer
comment
0
seems to be correct !
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
39
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 of $0's$ and $1's$ that are palindromes; that is, the string ... $1's$ of the form $xy$, where $x\neq y$ and $x$ and $y$ are of the same length.
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 of $0's$ and $1's$ that are palindromes; that is, the string reads the same backward as forward. The set of all ... of all strings of $0's$ and $1's$ of the form $xy$, where $x\neq y$ and $x$ and $y$ are of the same length.
asked
Aug 17, 2019
in
Compiler Design
Lakshman Patel RJIT
39
views
ullman
compiler-design
context-free-grammars
descriptive
1
vote
0
answers
2
68
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$. $S\rightarrow +SS\mid \ast SS\mid a$ with string $+\ast aaa$ ... $bfactor\:\rightarrow\:not\:bfactor\mid (bexpr)\mid true\mid false$
Repeat Question $4.2.1$ for each of the following grammars and strings: $S\rightarrow 0S1\mid 01$ with string $000111$. $S\rightarrow +SS\mid \ast SS\mid a$ with string $+\ast aaa$. $S\rightarrow S(S)S\mid \epsilon$ with string $(()())$ ... $bterm\:\rightarrow\:bterm\:and\:bfactor\mid bfactor$ $bfactor\:\rightarrow\:not\:bfactor\mid (bexpr)\mid true\mid false$
asked
Aug 17, 2019
in
Compiler Design
Lakshman Patel RJIT
68
views
ullman
compiler-design
context-free-grammars
parse-tree
ambiguous
descriptive
0
votes
0
answers
3
27
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$ or $\mid$) with the following meanings: Square braces ... can be generated by a grammar with these extensions can be generated by a grammar without the extensions.
There is an extended grammar notation in common use. In this notation, square and curly braces in production bodies are metasymbols (like $\rightarrow$ or $\mid$) with the following meanings: Square braces around a grammar symbol or symbols denotes that these ... is, any language that can be generated by a grammar with these extensions can be generated by a grammar without the extensions.
asked
Aug 17, 2019
in
Compiler Design
Lakshman Patel RJIT
27
views
ullman
compiler-design
descriptive
0
votes
0
answers
4
25
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}$. Hint: modify the table so it records, for each nonterminal $A$ in each table entry $T_{ij}$, some pair of nonterminals in other table entries that justified putting $A$ in $T_{ij}$.
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}$. Hint: modify the table so it records, for each nonterminal $A$ in each table entry $T_{ij}$, some pair of nonterminals in other table entries that justified putting $A$ in $T_{ij}$.
asked
Aug 20, 2019
in
Compiler Design
Lakshman Patel RJIT
25
views
ullman
compiler-design
context-free-grammars
descriptive
...