The first phase of a compiler is called __________ analysis., Lexical, A lexical analyzer is also known as a __________., Scanner, The sequence of characters in the source program that matches a token pattern is called a __________., Lexeme, A token consists of a token name and an optional __________ value., Attribute, A __________ table stores information about identifiers used in a program., Symbol, The set of strings represented by a regular expression is called a __________ language., Regular, A finite automaton that has exactly one transition for each input symbol from every state is called a __________., DFA, An automaton that can have multiple transitions for the same input symbol is called an __________., NFA, Regular expressions are mainly used to specify __________., Tokens, The process of grouping characters into tokens is called __________ analysis., Lexical, The second phase of a compiler is called __________ analysis., Syntax, The component of a compiler that performs syntax analysis is called a __________., Parser, A grammar used to describe the syntax of programming languages is called a __________ grammar., Context-free, CFG stands for __________., Context-Free Grammar, A tree representation of a derivation is called a __________ tree., Parse, A grammar that generates more than one parse tree for the same string is called an __________ grammar., Ambiguous, __________ parsing starts from the start symbol and attempts to derive the input string., Top-down, __________ parsing starts with the input symbols and attempts to reach the start symbol., Bottom-up, In top-down parsing, __________ recursion must generally be eliminated., Left, LR stands for __________ scanning of the input from left to right, producing a rightmost derivation in reverse., Left, LALR stands for __________ LR., Look-Ahead, A parser that uses a stack to perform shift and reduce operations is called a __________ parser., LR, The phase of a compiler that checks the __________ of a program is called semantic analysis., Meaning, Attributes that are passed from parent nodes to child nodes are called __________ attributes., Inherited, Attributes that are computed from the attributes of child nodes are called __________ attributes., Synthesized, An attribute grammar consists of a context-free grammar and a set of __________., Attributes, A graph that represents the dependencies among attributes is called a __________ graph., Dependency, S-attributed definitions use only __________ attributes., Synthesized, L-attributed definitions can contain both inherited and __________ attributes., synthesized, SDD stands for __________-Directed Definition., Syntax

compiler design

by
Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?