Back to the 2022 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORY____ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20212mFormal Language & Automata Theory\_\_\_\_ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20212m Compiler DesignChoose the correct answer of the following: A grammar that produces more than one parse tree for some sentence is said to be (i) Ambiguous (ii) context free (iii) disambiguous (iv) regular20222m Compiler DesignChoose the correct answer of the following: The output of a lexical analyzer is (i) a machine code (ii) an intermediate code (iii) a stream of tokens (iv) a parse tree20222m
PreviousIf L1 and L2 are context free languages, L1 - L2 is ___________ context-free. (i) always (ii) sometimes (iii) never (iv) None of theseNextWhich of the following pairs of regular expressions are equivalent? (i) x^* and x^*x (ii) 1(01)^* and (10)^*1 (iii) x(xx)^* and (xx)^*x (iv) All of the above