Compilers · Phases interview questions

1. A.building the parse tree from the input tokens up to the start symbol by reductions, as in LR parsers
2. B.a program that translates an entire source program into machine or intermediate code before execution
3. C.a data structure storing identifiers with their types, scopes, and attributes for use across phases
4. D.a parse tree mirrors every grammar rule, while an abstract syntax tree keeps only meaningful structure

Answer + AI explanation with a free account

1. A.compiler
2. B.lexical analysis
3. C.syntax analysis
4. D.parse tree vs AST

Answer + AI explanation with a free account

1. A.compiler — building the parse tree from the input tokens up to the start symbol by reductions, as in LR parsers
2. B.compiler — the first compiler phase that scans source characters and groups them into tokens
3. C.compiler — a program that translates an entire source program into machine or intermediate code before execution
4. D.compiler — LL scans left-to-right with leftmost derivation top-down, while LR uses rightmost derivation bottom-up

Answer + AI explanation with a free account

1. A.a machine-independent representation, such as three-address code, generated between front and back ends
2. B.the first compiler phase that scans source characters and groups them into tokens
3. C.a program that executes source code statement by statement without producing a separate binary
4. D.building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers

Answer + AI explanation with a free account

1. A.token
2. B.parse tree vs AST
3. C.interpreter
4. D.bottom-up parsing

Answer + AI explanation with a free account

1. A.interpreter — LL scans left-to-right with leftmost derivation top-down, while LR uses rightmost derivation bottom-up
2. B.interpreter — a machine-independent representation, such as three-address code, generated between front and back ends
3. C.interpreter — building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
4. D.interpreter — a program that executes source code statement by statement without producing a separate binary

Answer + AI explanation with a free account

1. A.a parse tree mirrors every grammar rule, while an abstract syntax tree keeps only meaningful structure
2. B.the phase that transforms intermediate code to run faster or use fewer resources without changing meaning
3. C.building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
4. D.the first compiler phase that scans source characters and groups them into tokens

Answer + AI explanation with a free account

1. A.intermediate code
2. B.top-down parsing
3. C.lexical analysis
4. D.code optimization

Answer + AI explanation with a free account

1. A.lexical analysis — a program that translates an entire source program into machine or intermediate code before execution
2. B.lexical analysis — building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
3. C.lexical analysis — the first compiler phase that scans source characters and groups them into tokens
4. D.lexical analysis — a data structure storing identifiers with their types, scopes, and attributes for use across phases

Answer + AI explanation with a free account

1. A.a program that executes source code statement by statement without producing a separate binary
2. B.a data structure storing identifiers with their types, scopes, and attributes for use across phases
3. C.a categorized lexical unit such as a keyword, identifier, operator, or literal
4. D.building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers

Answer + AI explanation with a free account

1. A.token
2. B.symbol table
3. C.syntax analysis
4. D.code optimization

Answer + AI explanation with a free account

1. A.token — the phase that transforms intermediate code to run faster or use fewer resources without changing meaning
2. B.token — a categorized lexical unit such as a keyword, identifier, operator, or literal
3. C.token — building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
4. D.token — a program that executes source code statement by statement without producing a separate binary

Answer + AI explanation with a free account

1. A.a machine-independent representation, such as three-address code, generated between front and back ends
2. B.the parsing phase that builds a parse tree by checking tokens against the grammar
3. C.the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
4. D.a categorized lexical unit such as a keyword, identifier, operator, or literal

Answer + AI explanation with a free account

1. A.syntax analysis
2. B.code optimization
3. C.lexical analysis
4. D.parse tree vs AST

Answer + AI explanation with a free account

1. A.syntax analysis — LL scans left-to-right with leftmost derivation top-down, while LR uses rightmost derivation bottom-up
2. B.syntax analysis — building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
3. C.syntax analysis — the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
4. D.syntax analysis — the parsing phase that builds a parse tree by checking tokens against the grammar

Answer + AI explanation with a free account

1. A.the phase that transforms intermediate code to run faster or use fewer resources without changing meaning
2. B.the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
3. C.a program that executes source code statement by statement without producing a separate binary
4. D.a program that translates an entire source program into machine or intermediate code before execution

Answer + AI explanation with a free account

1. A.code generation
2. B.semantic analysis
3. C.bottom-up parsing
4. D.interpreter

Answer + AI explanation with a free account

1. A.semantic analysis — the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
2. B.semantic analysis — the first compiler phase that scans source characters and groups them into tokens
3. C.semantic analysis — the parsing phase that builds a parse tree by checking tokens against the grammar
4. D.semantic analysis — a program that translates an entire source program into machine or intermediate code before execution

Answer + AI explanation with a free account

1. A.a categorized lexical unit such as a keyword, identifier, operator, or literal
2. B.LL scans left-to-right with leftmost derivation top-down, while LR uses rightmost derivation bottom-up
3. C.a machine-independent representation, such as three-address code, generated between front and back ends
4. D.building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers

Answer + AI explanation with a free account

1. A.code optimization
2. B.syntax analysis
3. C.intermediate code
4. D.token

Answer + AI explanation with a free account

1. A.intermediate code — a categorized lexical unit such as a keyword, identifier, operator, or literal
2. B.intermediate code — a machine-independent representation, such as three-address code, generated between front and back ends
3. C.intermediate code — LL scans left-to-right with leftmost derivation top-down, while LR uses rightmost derivation bottom-up
4. D.intermediate code — the first compiler phase that scans source characters and groups them into tokens

Answer + AI explanation with a free account

1. A.the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
2. B.LL scans left-to-right with leftmost derivation top-down, while LR uses rightmost derivation bottom-up
3. C.the phase that transforms intermediate code to run faster or use fewer resources without changing meaning
4. D.the parsing phase that builds a parse tree by checking tokens against the grammar

Answer + AI explanation with a free account

1. A.code optimization
2. B.syntax analysis
3. C.intermediate code
4. D.interpreter

Answer + AI explanation with a free account

1. A.code optimization — a program that executes source code statement by statement without producing a separate binary
2. B.code optimization — the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
3. C.code optimization — a program that translates an entire source program into machine or intermediate code before execution
4. D.code optimization — the phase that transforms intermediate code to run faster or use fewer resources without changing meaning

Answer + AI explanation with a free account

1. A.the parsing phase that builds a parse tree by checking tokens against the grammar
2. B.the final phase that maps optimized intermediate code into target machine instructions
3. C.building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
4. D.a categorized lexical unit such as a keyword, identifier, operator, or literal

Answer + AI explanation with a free account

1. A.interpreter
2. B.token
3. C.LL vs LR parsing
4. D.code generation

Answer + AI explanation with a free account

1. A.code generation — the first compiler phase that scans source characters and groups them into tokens
2. B.code generation — the final phase that maps optimized intermediate code into target machine instructions
3. C.code generation — the phase that checks meaning rules like type compatibility and declared-before-use using the symbol table
4. D.code generation — a categorized lexical unit such as a keyword, identifier, operator, or literal

Answer + AI explanation with a free account

1. A.the final phase that maps optimized intermediate code into target machine instructions
2. B.a data structure storing identifiers with their types, scopes, and attributes for use across phases
3. C.a program that translates an entire source program into machine or intermediate code before execution
4. D.the phase that transforms intermediate code to run faster or use fewer resources without changing meaning

Answer + AI explanation with a free account

1. A.symbol table
2. B.bottom-up parsing
3. C.token
4. D.intermediate code

Answer + AI explanation with a free account

1. A.symbol table — a data structure storing identifiers with their types, scopes, and attributes for use across phases
2. B.symbol table — building the parse tree from the start symbol toward the input, as in recursive-descent and LL parsers
3. C.symbol table — the final phase that maps optimized intermediate code into target machine instructions
4. D.symbol table — a parse tree mirrors every grammar rule, while an abstract syntax tree keeps only meaningful structure

Answer + AI explanation with a free account