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
Context Free Languages
Is the following language CFL : { ww | w in (a+b)* and |w| <1000 }
practicalmetal
asked
in
Theory of Computation
Mar 21
by
practicalmetal
179
views
context-free-language
theory-of-computation
context-free-grammar
pushdown-automata
0
votes
1
answer
2
Context Free Languages
Is the following language context free: The set of all strings with number of a’s equal to number of b’s and the sum of a’s and b’s to be divisible by 3.
practicalmetal
asked
in
Theory of Computation
Mar 16
by
practicalmetal
175
views
context-free-language
theory-of-computation
context-free-grammar
pushdown-automata
5
votes
2
answers
3
GATE CSE 2023 | Question: 29
Consider the context-free grammar $G$ below \[ \begin{array}{l} S \rightarrow a S b \mid X \\ X \rightarrow a X \mid X b \mid a \mid b, \end{array} \] where $S$ and $X$ are non-terminals, and $a$ and $b$ are terminal symbols. The starting non- ... $G$ is $a^{\ast} b^{\ast}(a+b)$ The language generated by $G$ is not a regular language
admin
asked
in
Theory of Computation
Feb 15
by
admin
1.6k
views
gatecse-2023
theory-of-computation
context-free-grammar
2-marks
0
votes
0
answers
4
derive a language from a grammar
{M ∈ {a,b}∗ | M contains at least three bs} {N ∈ {a,b}∗ | N has an odd length and a is in the middle always}
moe12leb
asked
in
Theory of Computation
Jan 21
by
moe12leb
93
views
theory-of-computation
regular-language
context-free-grammar
0
votes
1
answer
5
context free grammar
S→ aS | bS | epsilon what is the language generated by this grammar ?
moe12leb
asked
in
Theory of Computation
Jan 21
by
moe12leb
93
views
theory-of-computation
context-free-grammar
0
votes
2
answers
6
context free grammar
what is the langauge generated by this grammar ? S-->aS | aSbS | ε what is the language
moe12leb
asked
in
Theory of Computation
Jan 21
by
moe12leb
104
views
theory-of-computation
context-free-language
context-free-grammar
0
votes
0
answers
7
Context Free Languages(CFG) Push Down Anutomata(PDA)
PDA for $a^i b^j | i \neq 2j+1$ ?
jaisyking
asked
in
Theory of Computation
Jan 12
by
jaisyking
63
views
theory-of-computation
context-free-grammar
pushdown-automata
context-free-language
0
votes
1
answer
8
Push Down Automation | Parsing | Input Buffer and Stack
Consider a situation, where the input buffer is still having elements, and our PDA has reached final state. Given that for next input element the final state has no transition defined. In above situation will the i/p string be ... in all cases May be accepted if empty stack acceptance is allowed in the given PDA Something else, I can explain
Souvik33
asked
in
Compiler Design
Dec 20, 2022
by
Souvik33
130
views
theory-of-computation
pushdown-automata
context-free-grammar
1
vote
0
answers
9
DRDO CSE 2022 Paper 2 | Question: 11
A context-free grammar is in Chomsky Normal Form if every rule is of the form \[ \begin{array}{l} A \longrightarrow B C \\ A \longrightarrow a \end{array} \] where $a$ is a terminal, $A, B$ and $C$ are variables except $B$ and $C$ cannot be ... } S \longrightarrow A S B \mid a B \\ A \longrightarrow B \mid S \\ B \longrightarrow b \mid \varepsilon \end{array} \]
admin
asked
in
Theory of Computation
Dec 15, 2022
by
admin
108
views
drdocse-2022-paper2
theory-of-computation
context-free-grammar
descriptive
7-marks
0
votes
0
answers
10
Context Free Grammar
Find context-free grammars for the following language L = { w : na(w) = 2nb(w); where w belongs {a, b}*}
moe12leb
asked
in
Theory of Computation
Nov 29, 2022
by
moe12leb
70
views
theory-of-computation
context-free-grammar
0
votes
1
answer
11
Context Free Grammar
Find context-free grammars for the following language The complement of the language L = belongs {a^n, b^n}
moe12leb
asked
in
Theory of Computation
Nov 29, 2022
by
moe12leb
114
views
theory-of-computation
context-free-grammar
0
votes
1
answer
12
#self_doubt#CFG
Are these two grammars equal? 1->------------------- S->X|epsilon X->BBX|epsilon B->a|b 2->------------ S->AAS|epsilon A->a|b
Dknights
asked
in
Theory of Computation
Nov 10, 2022
by
Dknights
72
views
theory-of-computation
context-free-grammar
0
votes
0
answers
13
Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct. Arithmetic expressions in postfix notation. Left-associative lists of identifiers separated by commas. Right-associative lists of identifiers separated by commas. Arithmetic expressions of integers and identifiers with the four binary operators +, -, *, /
Shongkor
asked
in
Compiler Design
Nov 4, 2022
by
Shongkor
214
views
compiler-design
context-free-grammar
1
vote
1
answer
14
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, 2022
by
rsansiya111
134
views
theory-of-computation
context-free-grammar
0
votes
0
answers
15
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, 2022
by
anupamsworld
192
views
regular-grammar
context-free-grammar
npda
dpda
theory-of-computation
0
votes
1
answer
16
Construct a grammar which generates all odd integers up to 999
clendaya
asked
in
Theory of Computation
Aug 11, 2022
by
clendaya
146
views
context-free-grammar
Page:
1
2
3
4
5
6
...
12
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
GO Classes NIELIT Test Series For 2023
Interview Experience : MTech Research(Machine Learning) at IIT Mandi
DRDO Scientist -B
ISRO Scientist-B 2023
BARC RECRUITMENT 2023
Subjects
All categories
General Aptitude
(2.8k)
Engineering Mathematics
(9.7k)
Digital Logic
(3.4k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.4k)
Others
(2.4k)
Admissions
(667)
Exam Queries
(1.0k)
Tier 1 Placement Questions
(17)
Job Queries
(77)
Projects
(9)
Unknown Category
(867)
Recent questions tagged context-free-grammar
Recent Blog Comments
Left with 10days, nothing heard back from them,...
I have updated the blog. Thanks for mentioning it.
Mtech(RA) CSE IIT Bombay Project 14 ?
Thanks man @ijnuhb because of u i cleared...
Yes : 720 General