Courses

# Test: Loop Jamming

## 10 Questions MCQ Test Compiler Design | Test: Loop Jamming

Description
This mock test of Test: Loop Jamming for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) Test: Loop Jamming (mcq) to study with solutions a complete question bank. The solved questions answers in this Test: Loop Jamming quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this Test: Loop Jamming exercise for a better result in the exam. You can find other Test: Loop Jamming extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

### What are the two types of Linear Grammar?

Solution:

Linear grammar is of 2 types Left and Right Linear Grammar.

QUESTION: 2

### Which Grammar is it?S → Aa A → Aab

Solution:

In Left-Linear grammars, all productions have the form: A→Bx or A→ x where x is some string of terminals.

QUESTION: 3

### Which Type of Grammar is it?S → Aa A → Aab | λ

Solution:

In this case they both correspond to the regular expression (ab)*a.

QUESTION: 4

A Regular Grammar is any right-linear or left-linear grammar.

Solution:

As it turns out the languages that can be generated by Regular Grammars is equivalent to those that can be specified by Regular Expressions.

QUESTION: 5

Regular Grammars generate Regular Languages.

Solution:

That’s why they are called regular languages.

QUESTION: 6

Can Left Linear grammar be converted to Right Linear grammar?

Solution:

Since right-linear grammars are regular, it follows that left-linear grammars are also regular.

QUESTION: 7

CFG is

Solution:

They are defined by rule A->b where A is non terminal and b is terminal.

QUESTION: 8

The idea of an automation with a stack as auxiliary storage

Solution:

Push Down Automata manipulate the Stack as a part of performing a transition.

QUESTION: 9

Transition of finite automata is

Solution:

Transition of finite automata is Finite Diagram.

QUESTION: 10

A context free language is called ambiguous if

Solution:

When two or more Left and right most derivative occur the grammar turn ambiguous.