Complier construction past paper

Complier construction all previous/ past question papers

#past paper #fyp #final year project #courses #computer science #programming language #project with source code #question paper

– Complier construction –Computer Science all subject past paper  – Complier construction  with source code – Complier construction    Course – Complier construction idea -Complier construction   MCQ – Complier construction Interview Question  –Computer Science all courses -Technology –University Past Paper -Programming language –Question paperold paper

Fall 21 Past paper

complier construction past question papers
complier construction past question papers




Complier construction Mid Term Exam 2021

  1. C# language is used for which kind of application.
  2. Design regular expression for relational operators.
  3. Design a regular expression for constants (digits plus floating point numbers):
  4. Defined EOF.
  5. Difference between compiler and interpreter.
  6. How to find the tokens/variables that are the ending symbols of a grammar with code.
  7. Defined tokens.
  8. Difference between Lexical Analyzer Syntax analysis.
  9. Design a regular expression for finding all the words starting with „t‟ and „m‟ in the following document.
  10. Defined Symbol Table.
  11. Defined hash table.
  12. How to find the tokens/variables that are the starting symbols of a grammar WITH CODE.

Q1:

Prove that the following grammar is ambiguous or not.

Provide unambiguous grammar for the following ambiguous grammar.

Eliminate the left recursion from the grammar.

Perform left factoring on the following grammar.





Q2:

  1. Construct the LL (1) parsing table for the following grammar. Also show the working of parsing algorithm to draw parse tree for the string int + int + int $.

Eà TX                   Xà +E | €            Tà (E) | int Y     Yà *T | €

  1. Find first () and follow () for the following grammar. Also determine whether the grammar is LL (1) or not?

Sà ACB| CbB |Ba            Aà da | BC         Bà g | €              Cà h | €

Q3:

Write a program to implement the recursive decent parser for the following grammar.

E à a + T             Tà(E)|a

Complier construction past paper 2022
Complier construction past paper 2022




# Complier construction #Computer Science all subject past paper  #Complier construction # Complier construction   Course  #Complier construction idea -Complier construction MCQ #Complier construction Interview Question  #Computer Science all courses #Technology –University Past Paper #Programming language #Question paper #old paper

adx

Scroll to Top