LR Parser MCQ

Test your knowledge with important LR Parser MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more LR Parser MCQs at Bissoy

• Assembler is a program that _________
  ক

  Puts programs into memory and executes them

  খ

  Translates the assembly language into machine language

  গ

  Writes in high level language and produces an object program

  ঘ

  None of the mentioned
• Uniform symbol table _________
  ক

  Has all constants in the program

  খ

  Permanent table of rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure

  গ

  Consists of full or partial list of the tokens as they appear in the program created by Lexical analysis and used for syntax analysis and interpretation

  ঘ

  A permanent table which has all key words and special symbols of the language in symbolic form
• Which of the following system program forgoes the production of object code to generate absolute machine code and load it into the physical main storage location from which it will be executed immediately upon completion of the assembly?
  ক

  Two pass assembler

  খ

  Load and go assembler

  গ

  Macro processor

  ঘ

  Linker
• A system program that setup an executable program in main memory ready for execution is?
  ক

  Assembler

  খ

  Linker

  গ

  Loader

  ঘ

  Load and go
• A loader is a program that _________
  ক

  Program that places functions into memory and prepares them for execution

  খ

  Program that automates the translation of assembly language into machine language

  গ

  Program accepting another program written in a high level language and produces as object program

  ঘ

  None of the mentioned
• A series of statements explaining how the data is to be processed is called _________
  ক

  Assembly

  খ

  Machine

  গ

  COBOL

  ঘ

  Program
• System program such as compiler are designed so that they are _________
  ক

  Re-enterable

  খ

  Non reusable

  গ

  Serially usable

  ঘ

  None of the mentioned
• Which of the following is a phase of a compilation process?
  ক

  Lexical Analysis

  খ

  Code Generation

  গ

  Lexical Analysis & Code Generation

  ঘ

  None of the mentioned
• Advantage of incorporating the macro-processor into pass 1 is that _________
  ক

  Many functions have to be implemented twice

  খ

  Functions are combined not necessarily creating intermediate files as output from the macro-processor and input to the assembler

  গ

  More flexibility is provided to the programmer in that he may use all the features of the assembler in conjunction with macros

  ঘ

  All of the mentioned
• What is terminal table?
  ক

  Contains all constants in the program

  খ

  Is a permanent table of decision rules in the form of patterns for matching with the uniform symbol table to discover syntactic structure

  গ

  Consist of a full or partial list of the token is as they appear in the program created by lexical analysis and used for syntax analysis and interpretation

  ঘ

  Is a permanent table which lists all keywords and special symbols of the language in symbolic form
• The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?
  ক

  Closure and goto operations work a little bit different

  খ

  Closure and goto operations work similarly

  গ

  Closure and additive operations work a little bit different

  ঘ

  Closure and associatively operations work a little bit different
• When ß is empty (A -> ß.,
  ক

  , the reduction by A-> a is done by _________ ] If next symbol is a terminal

  খ

  Only If the next input symbol is a

  গ

  Only If the next input symbol is A

  ঘ

  Only if the next input symbol is a
• When ß (in the LR(1) item A -> ß.a,
  ক

  is not empty, the look-head _________ ] Will be affecting

  খ

  Does not have any affect

  গ

  Shift will take place

  ঘ

  Reduction will take place
• When there is a reduce/reduce conflict?
  ক

  If a state does not know whether it will make a shift operation using the production rule i or j for a terminal

  খ

  If a state does not know whether it will make a shift or reduction operation using the production rule i or j for a terminal

  গ

  If a state does not know whether it will make a reduction operation using the production rule i or j for a terminal

  ঘ

  None of the mentioned
• If a state does not know whether it will make a shift operation or reduction for a terminal is called _________
  ক

  Shift/reduce conflict

  খ

  Reduce /shift conflict

  গ

  Shift conflict

  ঘ

  Reduce conflict
• Which of the following is incorrect for the actions of A LR-Parser I) shift s ii) reduce A->ß iii) Accept iv) reject?
  ক

  Only I)

  খ

  I) and ii)

  গ

  I), ii) and iii)

  ঘ

  I), ii) , iii) and iv)
• Which of these is true about LR parsing?
  ক

  Is most general non-backtracking shift-reduce parsing

  খ

  It is still efficient

  গ

  Is most general non-backtracking shift-reduce parsing & It is still efficient

  ঘ

  None of the mentioned
• An LR-parser can detect a syntactic error as soon as __________
  ক

  The parsing starts

  খ

  It is possible to do so a left-to-right scan of the input

  গ

  It is possible to do so a right-to-left scan of the input

  ঘ

  Parsing ends
• What is the similarity between LR, LALR and SLR?
  ক

  Use same algorithm, but different parsing table

  খ

  Same parsing table, but different algorithm

  গ

  Their Parsing tables and algorithm are similar but uses top down approach

  ঘ

  Both Parsing tables and algorithm are different
• Which of these is also known as look-head LR parser?
  ক

  SLR

  খ

  LR

  গ

  LLR

  ঘ

  None of the mentioned