| 11. | The following features are needed to implement top down parsing |
| a. | Source string marker |
| b. | Prediction making mechanism |
| c. | Matching and Backtracking mechanism |
| d. | All of the above |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (d).All of the above
|
| 12. | An analysis, which determines the syntactic structure of the source statement, is called |
| a. | Sementic analysis |
| b. | process analysis |
| c. | Syntax analysis |
| d. | function analysis |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (c).Syntax analysis
|
| 13. | Recognition of basic syntactic constructs through reductions, this task is performed by |
| a. | Lexical analysis |
| b. | Syntax analysis |
| c. | Semantic analysis |
| d. | Structure analysis |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).Syntax analysis
|
| 14. | Which of the following derivation a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order ? |
| a. | Leftmost derivation |
| b. | Leftmost derivation traced out in reverse |
| c. | Rightmost derivation |
| d. | Rightmost derivation traced out in reverse |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (a).Leftmost derivation
|
| 15. | The error that can be pointed out by the compiler are |
| a. | syntax errors |
| b. | semantic errors |
| c. | logical errors |
| d. | internal errors |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (a).syntax errors
|
| 16. | The task of the logical analysis phase is |
| a. | to parse the source program into the basic elements or token of the language |
| b. | to build the literal table and an identifier table |
| c. | to build a uniform symbol table |
| d. | all of the above |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (a).to parse the source program into the basic elements or token of the language
|
| 17. | The output of lexical analyzer is |
| a. | a set of regular expressions |
| b. | syntax tree |
| c. | set of tokens |
| d. | string of characters |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (c).set of tokens
|
| 18. | Pick the machine independent pahse of the compiler |
| a. | syntax analysis |
| b. | lexical analysis |
| c. | intermediate code generation |
| d. | all of the above |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (d).all of the above
|
| 19. | The bottom up parser generates |
| a. | right most derivation |
| b. | right most derivation in reverse |
| c. | left most derivation |
| d. | left most derivation in reverse |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (b).right most derivation in reverse
|
| 20. | The top down parser generates |
| a. | right most derivation |
| b. | right most derivation in reverse |
| c. | left most derivation |
| d. | left most derivation in reverse |
| View Answer Report Discuss Too Difficult! Search Google |
|
Answer: (c).left most derivation
|
