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
what is the number of steps required to derive the string ((() ()) ()) for the folling grammar
[closed]
Anuanu
asked
in
Programming in C
Jun 24, 2016
closed
Jul 6, 2016
by
Desert_Warrior
402
views
0
votes
0
votes
closed as a duplicate of:
ISRO2014-5
Anuanu
asked
in
Programming in C
Jun 24, 2016
closed
Jul 6, 2016
by
Desert_Warrior
by
Anuanu
402
views
comment
Follow
share this
share
1 comment
by
Rajesh Pradhan
commented
Jun 24, 2016
reply
Follow
share this
I know this is an ISRO question... But it is incomplete.
Plz upload full question.
1
1
Please
log in
or
register
to add a comment.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
2
answers
1
Sanjay Sharma
asked
in
Theory of Computation
Apr 16, 2017
2,959
views
Number of productions to derive a string of length x
Sanjay Sharma
asked
in
Theory of Computation
Apr 16, 2017
by
Sanjay Sharma
3.0k
views
3
votes
3
votes
4
answers
2
Harit
asked
in
Compiler Design
Apr 25, 2016
5,495
views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
Harit
asked
in
Compiler Design
Apr 25, 2016
by
Harit
5.5k
views
compiler-design
context-free-grammar
parsing
numerical-answers
normal
1
vote
1
vote
2
answers
3
sh!va
asked
in
Linear Algebra
Jul 12, 2016
5,423
views
What is the minimum number of multiplications required to compute the chain of matrices?
What is the minimum number of multiplications required to compute the chain of matrices A = A1.A2.A3.A4 with size of A1 is 10x100, A2 is 100x5, A3 is 5x50, and A4 is 50x1?
sh!va
asked
in
Linear Algebra
Jul 12, 2016
by
sh!va
5.4k
views
matrix
1
vote
1
vote
0
answers
4
brijmohan
asked
in
Theory of Computation
Aug 6, 2016
740
views
The string for which the grammar has maximum of two derivation trees is
The string for which the grammar has maximum of two derivation trees is (a) lion tiger lion (c) tiger lion (b) lion tiger (d) None of the above
brijmohan
asked
in
Theory of Computation
Aug 6, 2016
by
brijmohan
740
views
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Programming
(4.1k)
Programming in C
(4.1k)
Programming in Python
(5)
DS
(2.0k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
