0% found this document useful (0 votes)
169 views

Programming Languages With Compiler FQuiz 1 PDF

This document summarizes the results of a student's attempt at a final quiz for a course on semantic analysis. The student answered all 10 multiple choice questions correctly, receiving full marks and a grade of 100% on the quiz. It reviews the key concepts tested in the quiz, including bottom-up parsing, predictive parsing, top-down parsing, lookahead, and the differences between lexical analysis and parsing.

Uploaded by

Jr Cialana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
169 views

Programming Languages With Compiler FQuiz 1 PDF

This document summarizes the results of a student's attempt at a final quiz for a course on semantic analysis. The student answered all 10 multiple choice questions correctly, receiving full marks and a grade of 100% on the quiz. It reviews the key concepts tested in the quiz, including bottom-up parsing, predictive parsing, top-down parsing, lookahead, and the differences between lexical analysis and parsing.

Uploaded by

Jr Cialana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

10/4/2020 Final Quiz1: Attempt review

Home / My courses / UGRD-CS6207-2013T / Week #11: Semantic Analysis / Final Quiz1

Started on Sunday, 4 October 2020, 4:41 PM


State Finished
Completed on Sunday, 4 October 2020, 4:44 PM
Time taken 2 mins 55 secs
Marks 10.00/10.00
Grade 100.00 out of 100.00

Question 1 Another approach in parsing that starts with the string and reduce it to the start symbol by applying
Correct the productions backwards
Mark 1.00 out of
1.00 Select one:
a. Bottom-up Parsing  

b. Middle-up 

c. Top-Down  

d. Bottom-down

Your answer is correct.

The correct answer is: Bottom-up Parsing 

Question 2 It is characterized by its ability to choose the production to apply solely on the basis of the next input
Correct symbol and the current non-terminal being processed.
Mark 1.00 out of
1.00 Select one:
a. Comparative Parser

b. None of the above

c. Historical Parser 

d. Analytical Parser 

e. Predictive Parser  

Your answer is correct.

The correct answer is: Predictive Parser 

Question 3 It’s a way to implement a non-backtracking top-down parser.


Correct

Mark 1.00 out of Select one:


1.00
a. Historical Parser

b. Analytical Parser 

c.  Comparative Parser
a.      Comparative Parser

d. None of the Above

e. Predictive Parser  

This study source was downloaded by 100000806178292 from CourseHero.com on 11-04-2022 00:38:38 GMT -05:00

Your answer is correct.


https://www.coursehero.com/file/103146299/Programming-Languages-with-Compiler-FQuiz-1pdf/

The correct answer is: Predictive Parser


https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=810959&cmid=36538 1/3
10/4/2020 Final Quiz1: Attempt review
The correct answer is: Predictive Parser 

Question 4 These are seen in order appearance in the token stream.


Correct

Mark 1.00 out of Select one:


1.00
a. Segments

b. Nodes

c. Leaves

d. Terminal 

e. None of the above

Your answer is correct.

The correct answer is: Terminal

Question 5 An approach in parsing that starts with the start symbol and apply the productions until it arrives at the
Correct desired string.
Mark 1.00 out of
1.00 Select one:
a. Top-Down   

b. Middle-up 

c. None of the Above

d. Bottom-down

e. Bottom-up Parsing 

Your answer is correct.

The correct answer is: Top-Down  

Question 6 Placing some restrictions on how to process the input is done in creating a parser for a compiler.
Correct

Mark 1.00 out of Select one:


1.00
True 

False

The correct answer is 'True'.

Question 7 A top-down parser is that a parse tree created by bottom to top.


Correct

Mark 1.00 out of Select one:


1.00
True

False 

The correct answer is 'False'.

This study source was downloaded by 100000806178292 from CourseHero.com on 11-04-2022 00:38:38 GMT -05:00

https://www.coursehero.com/file/103146299/Programming-Languages-with-Compiler-FQuiz-1pdf/

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=810959&cmid=36538 2/3
10/4/2020 Final Quiz1: Attempt review

Question 8 It is the next symbol coming up in the input.


Correct

Mark 1.00 out of Select one:


1.00
a. Predecessor

b. None of the above

c. Lookahead 

d. Successor

Your answer is correct.

The correct answer is: Lookahead

Question 9 Bottom-down and Top-up are the two major parsing approaches in parsing.
Correct

Mark 1.00 out of Select one:


1.00
True

False 

The correct answer is 'False'.

Question 10 The lexical analysis phase of a compiler verifies that the sequence of tokens extracted by the scanner
Correct represents a valid sentence in the grammar of the programming language
Mark 1.00 out of
1.00 Select one:
True

False 

The correct answer is 'False'.

◄ Semantics Jump to... Runtime Environments (Part 1) ►

This study source was downloaded by 100000806178292 from CourseHero.com on 11-04-2022 00:38:38 GMT -05:00

https://www.coursehero.com/file/103146299/Programming-Languages-with-Compiler-FQuiz-1pdf/

https://trimestral.amaesonline.com/mod/quiz/review.php?attempt=810959&cmid=36538 3/3
Powered by TCPDF (www.tcpdf.org)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy