#COMPILER DESIGN PDF CODE#
The processor allows only register operands in its instructions and the given code segment is executed in that processor. What is the maximum number of reduces moves that can be taken by a bottom-up parser for this grammar?įor questions 6 and 7 refer to the data given below: of type A->ε andĪ ->a) to parse a string, with n tokens. The shift entries in both the tables may be identicalĪNS:- The go to part of both tables may be differentĥ) We have a grammar with not epsilon and unit production (i.e. The go to part of both tables may be differentĭ. The error entries in both the tables may be differentĬ. The reduce entries in both the tables may be differentī.
#COMPILER DESIGN PDF FREE#
The grammar rules that violate the requirements of an operator grammar isĤ) Which one of the following statement is false for the SLR (1) and LALR (1) parsing tables for a context free grammar?Ī. Implementation of lexical and syntax analysis is easierĪNS:- Implementation of lexical and syntax analysis is easierģ) Consider the grammar where P, Q, R are not terminals and r, s, t are terminals
Portability of the front end of the compiler is enhancedĭ. To generate code for real machines directly from high-level language programs is not possibleĬ. Syntax-directed translations can be written for intermediate code generationī. There is a scope of common sub-expression eliminationĪNS:- There is a scope of dead code eliminationĢ) In compilers generation of intermediate code based on an abstract machine model is useful becauseĪ. There is a scope of dead code eliminationĬ. COMPILER DESIGN Multiple Choice Questions :-ġ) For the C program given below the statement that does not hold true isī.
0 kommentar(er)
