Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged context-free-grammar
0
votes
1
answer
1
PhD Qualifier Examination, Paper I
Give a context-free grammar for the set of all strings over the alphabet {a, b} with exactly twice as many a’s as b’s. Explain the working of the grammar by characterizing the strings generated by each non-terminal.
rsansiya111
asked
in
Theory of Computation
Sep 17
by
rsansiya111
43
views
theory-of-computation
context-free-grammar
0
votes
0
answers
2
PDA | TOC | Practice Question
Identify the type of the given language and draw the corresponding automata for the language. $L=\left \{a^{i}b^{j}c^{k} \space\ | \space\ j=max(i,k) \right \}$ A] Regular B] DCFL C] CFL but not DCFL D] Non-CFL Please describe your selection.
anupamsworld
asked
in
Theory of Computation
Sep 2
by
anupamsworld
72
views
regular-grammar
context-free-grammar
npda
dpda
theory-of-computation
0
votes
1
answer
3
Construct a grammar which generates all odd integers up to 999
clendaya
asked
in
Theory of Computation
Aug 11
by
clendaya
82
views
context-free-grammar
0
votes
2
answers
4
made easy test series - parsing - context-free grammar
Consider the following context-free grammar: Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
atulcse
asked
in
Compiler Design
Jan 16
by
atulcse
259
views
context-free-language
context-free-grammar
parsing
made-easy-test-series
3
votes
2
answers
5
#Gate CS Applied Course Mock Test
Is this Language a CFL? If yes, Can you please explain the implementation.
Rajesh Reddy
asked
in
Theory of Computation
Jan 3
by
Rajesh Reddy
310
views
theory-of-computation
context-free-language
context-free-grammar
1
vote
1
answer
6
Test series Made easy
How to solve this ? Please help.
raja11sep
asked
in
Compiler Design
Dec 31, 2021
by
raja11sep
401
views
compiler-design
grammar
context-free-grammar
ll-parser
descriptive
made-easy-test-series
1
vote
1
answer
7
made easy test 1 2022
how option 2 is correct becz regular lang. dosnt accept comparision can anyone explain?
jugnu1337
asked
in
Theory of Computation
Dec 16, 2021
by
jugnu1337
139
views
context-free-grammar
2
votes
1
answer
8
Greibach Normal Form
Convert the following grammar into Greibach Normal Form. E-> E + T | T T-> T*F | F F->(E) | a I am unable to process this type of grammer into GNF, Can someone please provide a detailed explaination?
hustlerrr
asked
in
Theory of Computation
Nov 17, 2021
by
hustlerrr
556
views
theory-of-computation
context-free-grammar
gnf
3
votes
1
answer
9
Applied Test Series
How to approach with such questions. Do we have to generate strings to validate the property of the grammars ?
LRU
asked
in
Theory of Computation
Oct 3, 2021
by
LRU
175
views
test-series
theory-of-computation
context-free-grammar
1
vote
2
answers
10
can someone share the approach for the following que
14.Show that the grammar S → aSb |SS| e is ambiguous, but that the language denoted by it is not. Can someone share the approach for second part.
mk_007
asked
in
Theory of Computation
Oct 3, 2021
by
mk_007
137
views
context-free-language
context-free-grammar
ambiguous
0
votes
1
answer
11
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 10
Consider an $\varepsilon$-tree CFG. If for every pair of productions $A\rightarrow u$ and $A\rightarrow v$ If $\text{FIRST(u)} \cap \text{FIRST(v)}$ is empty then the CFG has to be $LL(1).$ If the CFG is $LL(1)$ then $\text{FIRST(u)} \cap \text{FIRST(v)}$ has to be empty. Both $(A)$ and $(B)$ None of the above
Lakshman Patel RJIT
asked
in
Compiler Design
Apr 1, 2020
by
Lakshman Patel RJIT
2.6k
views
nielit2017oct-assistanta-cs
compiler-design
context-free-grammar
first-and-follow
0
votes
1
answer
12
NIELIT 2016 MAR Scientist B - Section C: 29
The CFG $S \to aS\mid bS\mid a\mid b$ is equivalent to $(a+b)$ $(a+b)(a+b)^*$ $(a+b)(a+b)$ all of these
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 31, 2020
by
Lakshman Patel RJIT
914
views
nielit2016mar-scientistb
theory-of-computation
context-free-grammar
0
votes
1
answer
13
NIELIT 2017 DEC Scientist B - Section B: 7
Let $G$ be a grammar in CFG and let $W_1,W_2\in L(G)$ such that $\mid W_1\mid=\mid W_2\mid$ then which of the following statements is true? Any derivation of $W_1$ has exactly the same number of steps as any derivation ... $W_1$ may be shorter than the derivation of $W_2$ None of the options
Lakshman Patel RJIT
asked
in
Theory of Computation
Mar 30, 2020
by
Lakshman Patel RJIT
591
views
nielit2017dec-scientistb
theory-of-computation
context-free-grammar
0
votes
1
answer
14
NIELIT 2017 DEC Scientist B - Section B: 26
The grammar $S\rightarrow aSb\mid bSa\mid SS\mid \varepsilon $ is: Unambiguous CFG Ambiguous CFG Not a CFG Deterministic CFG
Lakshman Patel RJIT
asked
in
Compiler Design
Mar 30, 2020
by
Lakshman Patel RJIT
835
views
nielit2017dec-scientistb
compiler-design
compilations
context-free-grammar
ambiguous
0
votes
2
answers
15
UGC NET CSE | January 2017 | Part 3 | Question: 22
Let $G= (V,T,S,P)$ be a context-free grammer such that every one of its productions is of the form $A\rightarrow v$, with $\mid v \mid=K> 1$. The derivation tree for any $W \in L(G)$ has a height $h$ ... $\log_{K}|W \mid \leq h \leq \left (\frac{ \mid W \mid - 1}{K-1} \right)$
go_editor
asked
in
Theory of Computation
Mar 24, 2020
by
go_editor
483
views
ugcnetcse-jan2017-paper3
context-free-grammar
theory-of-computation
1
vote
4
answers
16
ISRO2020-39
The language which is generated by the grammar $S \rightarrow aSa \mid bSb \mid a \mid b$ over the alphabet of $\{a,b\}$ is the set of Strings that begin and end with the same symbol All odd and even length palindromes All odd length palindromes All even length palindromes
Satbir
asked
in
Theory of Computation
Jan 13, 2020
by
Satbir
1.0k
views
isro-2020
theory-of-computation
context-free-grammar
normal
3
votes
0
answers
17
Michael Sipser Edition 3 Exercise 5 Question 36 (Page No. 242)
Say that a $CFG$ is minimal if none of its rules can be removed without changing the language generated. Let $MIN_{CFG} = \{\langle G \rangle \mid \text{G is a minimal CFG}\}$. Show that $MIN_{CFG}$ is $T-$recognizable. Show that $MIN_{CFG}$ is undecidable.
Lakshman Patel RJIT
asked
in
Theory of Computation
Oct 20, 2019
by
Lakshman Patel RJIT
452
views
michael-sipser
theory-of-computation
context-free-grammar
recursive-and-recursively-enumerable-languages
decidability
proof
0
votes
0
answers
18
Michael Sipser Edition 3 Exercise 5 Question 32 (Page No. 241)
Prove that the following two languages are undecidable. $OVERLAP_{CFG} = \{\langle G, H\rangle \mid \text{G and H are CFGs where}\: L(G) \cap L(H) \neq \emptyset\}$. $PREFIX-FREE_{CFG} = \{\langle G \rangle \mid \text{G is a CFG where L(G) is prefix-free}\}$.
Lakshman Patel RJIT
asked
in
Theory of Computation
Oct 20, 2019
by
Lakshman Patel RJIT
346
views
michael-sipser
theory-of-computation
context-free-grammar
turing-machine
decidability
proof
Page:
1
2
3
4
5
6
...
11
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged context-free-grammar
Recent Blog Comments
@Arjun @Deepak Sir, In Test Schedule google...
sir is this for gate? it has way more questions...
https://gateoverflow.in/tag/gate2010 this link is...
previous years than GATE 2010 paper
Which link are you referring to?