Test: Parsing Techniques- 1


Test Description

10 Questions MCQ Test Question Bank for GATE Computer Science Engineering | Test: Parsing Techniques- 1

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

Which is not true about syntax and semantic parts of a computer language

Detailed Solution for Test: Parsing Techniques- 1 - Question 1

Syntax analysis checks for the syntax of the source program while the semantic analysis, deals with checking of semantic (meaning) of the source program output by syntax analysis phase and input to semantic analysis phase.
Note: The syntax checking is responsibility of the programmer while semantic analys is is checked at the runtime.

Test: Parsing Techniques- 1 - Question 2

Left factoring is the process of factoring out the common

Detailed Solution for Test: Parsing Techniques- 1 - Question 2

Left factoring is the process of removing the non-determinism from the grammar by factoring out the common prefixes of the alternates.

Test: Parsing Techniques- 1 - Question 3

Operator-precedence parsing method is a parsing method. Which of the following statement is false about it?
1. It is bottom-up parsing method.
2. It must contains ε-production.
3. It doesn’t contains two adjacent nonterminal symbols.

Detailed Solution for Test: Parsing Techniques- 1 - Question 3

Rules of operator precedence grammar is given as:
1. It must not contain any null-production.
2. It must not contain two adjacent non-terminal symbols.

Test: Parsing Techniques- 1 - Question 4

If conversion from one type to another type is done automatically by the compiler then, it is called

Detailed Solution for Test: Parsing Techniques- 1 - Question 4

If compiler automatically converts one type of from to another type then it is called implicit conversion or coercions, else if not done automatically, then it is called explicit conversion.

Test: Parsing Techniques- 1 - Question 5

Which of the following derivations does a top- down parser use while parsing as input string? The input is assumed to be scanned in left to right order

Detailed Solution for Test: Parsing Techniques- 1 - Question 5

Top down parser uses left to right, left most derivation.

Test: Parsing Techniques- 1 - Question 6

Which of the following statements is true?

Detailed Solution for Test: Parsing Techniques- 1 - Question 6

The canonical LR parser is the most powerful parser that can recognize more grammars than other parsers.

Test: Parsing Techniques- 1 - Question 7

A bottom-up parser generates

Detailed Solution for Test: Parsing Techniques- 1 - Question 7

Bottom-up parsing recognizes the text’s lowest level small details first, before its mod-level structures and leaving the highest-level overall structure to last. It is some times done by backtracking and much more commonly by a shift-reduce parser such as LALR parser.

Test: Parsing Techniques- 1 - Question 8

A top-down parser generates

Detailed Solution for Test: Parsing Techniques- 1 - Question 8

Top-down parsing is the parsing strategy which one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of formed grammar. LL parsers are the parsers that the top-down parsing strategy.

Test: Parsing Techniques- 1 - Question 9

Which of the following grammar is LR(1)

Detailed Solution for Test: Parsing Techniques- 1 - Question 9

If we create LL (1) items, we will find out that (a) and (b) both are LR(1).

Test: Parsing Techniques- 1 - Question 10

Which of the following parsers is the most powerful?

Detailed Solution for Test: Parsing Techniques- 1 - Question 10

CLR > LALR > SLR

Use Code STAYHOME200 and get INR 200 additional OFF
Use Coupon Code
Information about Test: Parsing Techniques- 1 Page
In this test you can find the Exam questions for Test: Parsing Techniques- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Parsing Techniques- 1, EduRev gives you an ample number of Online tests for practice