# Finding Patterns in Text,Algebric Laws and Derivatives Online Exam Quiz

Finding Patterns in Text,Algebric Laws and Derivatives GK Quiz. Question and Answers related to Finding Patterns in Text,Algebric Laws and Derivatives. MCQ (Multiple Choice Questions with answers about Finding Patterns in Text,Algebric Laws and Derivatives

### A CFG is ambiguous if

Options

A : It has more than one rightmost derivations

B : It has more than one leftmost derivations

C : No parse tree can be generated for the CFG

D : None of the mentioned

### A CFG is not closed under

Options

A : Dot operation

B : Union Operation

C : Concatenation

D : Iteration

### A->aAa|bAb|a|b|e^ Which among the following is the correct option for the given production?

Options

A : Left most derivation

B : Right most derivation

C : Recursive Inference

D : None of the mentioned

### Choose the incorrect process to check whether the string belongs to the language of certain variable or not?

Options

A : recursive inference

B : derivations

C : head to body method

D : All of the mentioned

Options

A : TRUE

B : FALSE

C : -

D : -

### Statement: Left most derivations are lengthy as compared to Right most derivations.^ Choose the correct option:

Options

A : correct statement

B : incorrect statement

C : may or may not be correct

D : depends on the language of the grammar

Options

A : 0

B : 1

C : 100

D : 22/7

### Which of the following are always unambiguous?

Options

A : Deterministic Context free grammars

B : Non-Deterministic Regular grammars

C : Context sensitive grammar

D : None of the mentioned

### Which of the following is a parser for an ambiguous grammar?

Options

A : GLR parser

B : Chart parser

C : All of the mentioned

D : None of the mentioned

### Which of the following is an real-world programming language ambiguity?

Options

A : dangling else problem

B : halting problem

C : maze problem

D : none of the mentioned

### Ambiguous Grammar more Online Exam Quiz

Applications of DFA

Applications of NFA

Applications of Pumping Lemma/Pigeonhole principle

CFG-Eliminating Useless Symbols

Deterministic Finite Automata-Introduction and Definition

From Grammars to Push Down Automata

Node-Cover Problem, Hamilton Circuit Problem

Problem Solvable in Polynomial Time

Properties-Non Regular Languages

Regular Language & Expression - 1