Which phase of a compiler commonly identifies declared identifiers during scanning and may create their initial Symbol Table entries?
The lexical analyzer recognizes identifier tokens and, in compiler implementations that populate the table during scanning, can create initial symbol-table entries. Later phases may enrich those entries with additional semantic information.
In regular expressions, if language L1 = {$a^n$ | n >= 0} and L2 = {$b^n$ | n >= 0}, what does the concatenation L1.L2 represent?
Concatenation of two regular languages L1 and L2 generates strings consisting of any string from L1 followed independently by any string from L2, where powers n and m are independent.
Which of the following formal language classes is recognized by a Deterministic Finite Automaton (DFA) constructed during Lexical Analysis?
DFAs and NFAs recognize Regular Languages, which form the theoretical foundation for token specification and scanning in compilers.
[BPSC TRE 1.0 Class 11-12 PYQ] Which of the following is an essential task carried out by a Preprocessor prior to compilation?
Preprocessors handle macro expansion, header file inclusion, and conditional compilation commands before passing pure source code to the compiler.
What is the primary function of Thompson's Construction Algorithm in compiler design?
Thompson's Construction converts regular expressions into e-NFAs systematically, which can then be transformed into DFAs using the Subset Construction algorithm.