Test: Context Free Grammar - Computer Science Engineering (CSE) MCQ

# Test: Context Free Grammar - Computer Science Engineering (CSE) MCQ

Test Description

## 10 Questions MCQ Test Compiler Design - Test: Context Free Grammar

Test: Context Free Grammar for Computer Science Engineering (CSE) 2024 is part of Compiler Design preparation. The Test: Context Free Grammar questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Context Free Grammar MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Context Free Grammar below.
Solutions of Test: Context Free Grammar questions in English are available as part of our Compiler Design for Computer Science Engineering (CSE) & Test: Context Free Grammar solutions in Hindi for Compiler Design course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Context Free Grammar | 10 questions in 10 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Compiler Design for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
 1 Crore+ students have signed up on EduRev. Have you?
Test: Context Free Grammar - Question 1

### Assume the statements S1 and S2 given as: S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite. S2: There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true?

Detailed Solution for Test: Context Free Grammar - Question 1

The proof of S1 can be seen in various book of theory of computation but s2 is a problem of category undecidable so a contradiction to this assumption can be easily obtained.

Test: Context Free Grammar - Question 2

### If P & R are regular and also given that if PQ=R, then

Detailed Solution for Test: Context Free Grammar - Question 2

If two regular languages when combined do not always produce a regular language.

Test: Context Free Grammar - Question 3

### Which of the following conversion is not possible (algorithmically)?

Detailed Solution for Test: Context Free Grammar - Question 3

Not every NDPDA has an equivalent deterministic PDA.

Test: Context Free Grammar - Question 4

Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^) , (-,-) , (+,+) , (*,*) in the operator precedence table constructed for the grammar

Detailed Solution for Test: Context Free Grammar - Question 4

This relation is established of basis of the precedence of operators.

Test: Context Free Grammar - Question 5

Recursively enumerable languages are not closed under:

Detailed Solution for Test: Context Free Grammar - Question 5

Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.

Test: Context Free Grammar - Question 6

Grammar that produce more than one Parse tree for same sentence is:

Detailed Solution for Test: Context Free Grammar - Question 6

an ambiguous grammar is one for which there is more than one parse tree for a single sentence.

Test: Context Free Grammar - Question 7

Automaton accepting the regular expression of any number of a ‘ s is:

Detailed Solution for Test: Context Free Grammar - Question 7

It gives any number of a’s.

Test: Context Free Grammar - Question 8

Grammars that can be translated to DFAs:

Detailed Solution for Test: Context Free Grammar - Question 8

Right linear grammar can be translated to the DFAs.

Test: Context Free Grammar - Question 9

The language accepted by a Push down Automata:

Detailed Solution for Test: Context Free Grammar - Question 9

A known fact that type 2 grammar is accepted by PDA.

Test: Context Free Grammar - Question 10

Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?

Detailed Solution for Test: Context Free Grammar - Question 10

Recursive languages are closed under the following operations.
The Kleene star L * of L
the concatenation L * o P of L and P
the union L U P
the intersection L ∩ P.

## Compiler Design

26 videos|55 docs|30 tests
Information about Test: Context Free Grammar Page
In this test you can find the Exam questions for Test: Context Free Grammar solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Context Free Grammar, EduRev gives you an ample number of Online tests for practice

### Up next

 Test | 15 ques
 Test | 15 ques
 Test | 10 ques

## Compiler Design

26 videos|55 docs|30 tests

### Up next

 Test | 15 ques
 Test | 15 ques
 Test | 10 ques