Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Exams
Recent questions tagged grammar
+1
vote
0
answers
Turing Machine
As per the definition of a Turing Machine, it does not accept Epsilon. But, A → ϵ can be generated by a Unrestricted Grammar. So, how can we say that Turing Machines are the acceptors for Recursively Enumerable languages generated by Unrestricted Grammar?
asked
Feb 13
in
Theory of Computation
by
Joon88
(
7
points)

14
views
#toc
turingmachine
theoryofcomputation
grammar
unrestrictedgrammar
0
votes
0
answers
#compiler design LL(1)
Check whether grammar is LL(1) or not? 1.decidable 2.undecidable
asked
Nov 17, 2019
in
Compiler Design
by
amit166
(
139
points)

24
views
recursive
grammar
0
votes
0
answers
GradeUp Quiz ToC
Consider a grammar G A → AB AB → BC BC → CD CD → a The Language L generated by G is most accurately said to be Chomsky type 3 Chomsky type 2 Chomsky type 1 Chomsky type 0
asked
Sep 27, 2019
in
Theory of Computation
by
aditi19
(
55
points)

25
views
chomskyclassification
#toc
gradeup
grammar
0
votes
1
answer
Whether following language is linear or not?
I have a language $L= \{a^nb^nc^m : n, m \ge 0\}$. Now, I wanted to determine whether this language is linear or not. So, I came up with this grammar: $S \rightarrow A\thinspace\thinspace Sc$ ... So, I'm unable to find whether the language is linear or not and what goes wrong in above logic with either case. Please help.
asked
Sep 11, 2019
in
Theory of Computation
by
Vimal Patel
(
911
points)

17
views
grammar
#toc
theoryofcomputation
contextfreelanguage
0
votes
0
answers
Stanford Compilers course
Which of the following grammar(s) produce regular languages?
asked
Aug 9, 2019
in
Theory of Computation
by
siva_skl
(
6
points)

33
views
compiler
#toc
grammar
#regularlanguage
0
votes
1
answer
String generation
Identify from the following the string generated by following $ S→SS , $ $S \rightarrow \ (S_1, $ $ S_1→S) ,$ $S_1 \rightarrow ) $ A. $(( ) ( ) ))$ B. $((((( )))))) ($ C. $( ) ( ) ( ) ( ))$ D.$ (( ) ((( )) ( )))$
asked
Jul 31, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

20
views
madeeasyworkbook
grammar
theoryofcomputation
+2
votes
4
answers
fssai IT assistant exam 2019 Q15
What is the maximum number of language a contextfree Grammar (CFG) can generate? Three Two One Infinite
asked
Jul 31, 2019
in
Compiler Design
by
akshat sinha
(
12
points)

157
views
cfg
compiler_design
contextfreelanguages
compiler
grammar
–1
vote
1
answer
Ambiguity related to Context free grammar
asked
Jul 28, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

31
views
contextfreelanguages
grammar
theoryofcomputation
ambiguity
0
votes
1
answer
Context free grammar
asked
Jul 25, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

28
views
madeeasyworkbook
contextfreelanguages
grammar
theoryofcomputation
0
votes
2
answers
Regular grammar to string production
asked
Jul 17, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

39
views
madeeasyworkbook
regular
grammar
theoryofcomputation
0
votes
1
answer
Regular production Grammar
Consider the production grammar S→AB  AS A→a  aA B→b Which of the following regular expressions corresponding to the production grammar?
asked
Jul 17, 2019
in
Theory of Computation
by
kshubham538
(
5
points)

13
views
#regularexpression
regular
grammar
theoryofcomputation
madeeasyworkbook
0
votes
1
answer
Peter Linz
Write the grammar for the following language : $L = \{w : n_a (w)= n_b (w) + 1\}$ where no. of $a’s$ is one more than no. of $b’s.$
asked
Jul 6, 2019
in
Theory of Computation
by
googlegoku
(
9
points)

20
views
grammar
theoryofcomputation
peterlinz
0
votes
1
answer
theory of computation self doubt
Is it possible that there is a grammar which is RE but not recursive? If so then is there any example?
asked
Jul 3, 2019
in
Theory of Computation
by
Shubhm
(
23
points)

10
views
theoryofcomputation
grammar
0
votes
0
answers
Peter Linz Doubt Grammars
Find grammar for the language on $\sum$={a} L={w  w mod 3>0} is this correct? S>aA A>aB  $\varepsilon$ B>aS  $\varepsilon$
asked
Jun 20, 2019
in
Theory of Computation
by
aditi19
(
55
points)

16
views
grammar
theoryofcomputation
peterlinz
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users
Feb 2020
shashin
363 Points
Shaik Masthan
79 Points
SuvasishDutta
39 Points
srestha
33 Points
Mk Utkarsh
32 Points
neeraj_bhatt
31 Points
!KARAN
30 Points
Debapaul
23 Points
Pratyush Priyam Kuan
18 Points
kalra05
18 Points
Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,331
questions
1,581
answers
10,281
comments
89,916
users