Concepts of Programming Languages-Ch 4

Question 1

Bottom-up parsers construct parse trees beginning at the leaves and progressing toward the root

Accepted Answer

True

Question 2

Lexical analyzers deal with

Accepted Answer

Small-scale language constructs-names & numeric literals

Question 3

The regular expression [1-9][0-9]+ matches any number without a leading zero

Accepted Answer

True

Question 4

The two types of parsing algorithms are:

Accepted Answer

top-down and bottom-up

Question 5

BNF descriptions of languages can be used as the direct basis for syntax analyzers

Accepted Answer

True

Question 6

Top down parsers build parse trees in preorder beginning with the root

Accepted Answer

True

Question 7

The purpose of a lexical analyzer is to

Accepted Answer

Extract lexemes from input and produce corresponding tokens

Question 8

True or False: Compilers perform lexical analysis as the first part of syntax analysis.

Accepted Answer

True

Question 9

Syntax analyzers deal with

Accepted Answer

large-scale constructs: expressions/statements/program units

Question 10

Lexical analysis is separate from syntax analysis because

Accepted Answer

of simplicity, efficiency, and portability

Question 11

Parsing is another term for syntax analysis

Accepted Answer

True

Question 12

True or False: Parsing is synonymous with syntax analysis

Accepted Answer

True

Questions 12