Consider the following two sets:
| List I | List II |
|---|---|
| P. Lexical Analyzer | 1. Abstract Syntax Tree |
| Q. Syntax Analyzer | 2. Token |
| R. Intermediate Code Generator | 3. Parse Tree |
| S. Code Optimizer | 4. Constant Folding |
Which one of the following options is the CORRECT match from Set X to Set Y?
Which of the following is/are Bottom-Up Parser(s)?
Consider the operator precedence and associativity rules for the integer arithmetic operators given in the table below. Operator +…
Consider the following syntax-directed definition (SDD). S → DHTU { S.val = D.val + H.val + T.val + U.val; } D → "M"D1 { D.val = 5…
Consider the following grammar G, with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), …
Consider the following pseudo-code. L1: t1 = -1 L2: t2 = 0 L3: t3 = 0 L4: t4 = 4*t3 L5: t5 = 4*t2 L6: t6 = t5*M L7: t7 = t4+t6 L8:…
Which of the following statements is/are FALSE?
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.