Question
A->a B->b
A->aS B->bS
A->bAA B->aBB
how many derivation trees are there?
a.
1
b.
2
c.
3
d.
4
Posted under Compiler Design
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. S->bA S->aB A->a B->b A->aS B->bS A->bAA B->aBB how many derivation trees are there?
Similar Questions
Discover Related MCQs
Q. Which of the following are true?
(i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation
(ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function
(iii) Recursion in programming languages cannot be implemented with dynamic storage allocation
(iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records
(v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records
View solution
Q. An LALR(1) parser for a grammar can have shift-reduce (S-R) conflicts if and only if
View solution
Q. Which of the following statements are TRUE ?
I There exist parsing algorithms for some programming languages hose complex are less than θ(n 3 )
II A programming language which allows recursion can be implemented with static storage allocation
III No L-attributed definition can be evaluated in the framework of bottom-up parsing
IV Code improving transformations can be performed at both source language and intermediate code level
View solution
Q. What data structure in a complier is used for managing information about variables and their attributes?
View solution
Q. Which languages necessarily need heap allocation in the runtime environment?
View solution
Q. Given the language L-{ab, aa, baa}, which of the following strings are in LG?
1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa
View solution
Q. A simple two-pass assembler does which of the following in the first pass
View solution
Q. The lexical analyzer takes _________as input and produces a stream of _______as output.
View solution
Q. Task of the lexical analysis
View solution
Q. The output of lexical analyzer is a
View solution
Q. In a two pass assembler, adding literals to literal table and address resolution of local symbols are done using
View solution
Q. In Two pass assembler the object code generation is done during the
View solution
Q. Which of the following type of software should be used if you need to create, edit and print document?
View solution
Q. Output file of the Lex is _________ is the input file is Sam.
View solution
Q. Yacc is available as a command on the
View solution
Q. oading process can be divided into two programs. The first is binder the other is
View solution
Q. In Lex, a class is complemented by first placing
View solution
Q. Which of the following is not a feature of compiler?
View solution
Q. Predictive parsers can be
View solution
Q. An example of intermediate language is
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Compiler Design? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!