Let L be a language over ∑ i.e., *L ≤ ∑ . Suppose L satisfies the two conditions given below (i) L is in NP and […]

(a) Translate the arithmetic expression a*-(b+c) into syntax tree. (b) A grammar is said to have cycles if it is the case that A ⇒ +A […]

Match the pairs in the following questions: (a) Pointer data type (p) Type conversion (b) Activation record (q) Dynamic data structure (c) Repeat-until (r) Recursion (d) […]

Match the pairs in the following questions: (a) Lexical analysis (p) DAG's (b) Code optimization (q) Syntax trees (c) Code generation (r) Push down automaton (d) […]