Home > Computer Engineering > Quizzes > System Programming And Compiler Construction: Compiler
System Programming And Compiler Construction: Compiler
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 31% Most missed: “Keywords are recognized in a compiler during .”
System Programming And Compiler Construction: Compiler
Time left 00:00
25 Questions

1. The most general phase of structured grammar is?
2. Which of the following grammar can be translated into DFAs?
3. The compiler can detect what type of errors?
4. Which phase of the compiler checks the grammar of the programming?
5. Which derivation is generated by the top-down parser?
6. Which grammar gives multiple parse trees for the same string?
7. Which computer program accepts the high-level language and converts it into assembly language?
8. Which method merges the multiple loops into the single one?
9. Which symbol is not related to context-free grammar?
10. Which of the following tree is the pictorial identification of the derivation?
11. Leaf nodes in a parse tree indicate?
12. From the following grammars, which describes the lexical syntax?
13. Which of the following component is important for semantic analysis?
14. In which of the following tree, the leaf indicates the operand, and the interior node represents the operator.
15. Which algorithm invokes a function GETREG()?
16. Parsing is categorized into how many types?
17. Which derivation is generated by the top-down parser?
18. In the compiler, the function of using intermediate code is:
19. Which of the following term is used to keep track of the location where the current values of the name are stored?
20. Which of the following grammar has no two adjacent non-terminals?
21. Which tool is used for grouping of characters in tokens in the compiler?
22. Which of the following structure has four fields?
23. In which parsing, the parser constructs the parse tree from the start symbol and transforms it into the input symbol.
24. Which algorithm invokes a function GETREG()?
25. Leaf nodes in a parse tree indicate?