Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > To obtain a string of n Terminals from a give...
Start Learning for Free
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:
- a)2n − 1
- b)2n
- c)n + 1
- d)n2
Correct answer is option 'A'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
To obtain a string of n Terminals from a given Chomsky normal form gra...
Concept:
Chomsky normal form
S → AB
A → a
B → b
Length of string = n
Chomsky normal form
S → AB
A → a
B → b
Length of string = n
Length of the derivate of string n in context free grammar:
2|n| – 1
2|n| – 1
Example:
If we need to generate ab (string of length 2)
S → AB
S → aB
S → ab
Number of steps = 2 × 2 – 1 = 3
If we need to generate ab (string of length 2)
S → AB
S → aB
S → ab
Number of steps = 2 × 2 – 1 = 3
Free Test
FREE
| Start Free Test |
Community Answer
To obtain a string of n Terminals from a given Chomsky normal form gra...
The correct answer is b) 2n-1.
In Chomsky normal form grammar, all productions are of the form A -> BC or A -> a, where A, B, and C are non-terminals and a is a terminal.
To obtain a string of n terminals, we need to use n-1 productions of the form A -> BC and one production of the form A -> a.
Therefore, the total number of productions needed is (n-1) + 1 = n.
In Chomsky normal form grammar, all productions are of the form A -> BC or A -> a, where A, B, and C are non-terminals and a is a terminal.
To obtain a string of n terminals, we need to use n-1 productions of the form A -> BC and one production of the form A -> a.
Therefore, the total number of productions needed is (n-1) + 1 = n.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer?
Question Description
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer?.
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer?.
Solutions for To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer?, a detailed solution for To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? has been provided alongside types of To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:a)2n − 1b)2nc)n + 1d)n2Correct answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup