Q2-ixNATMarks unknownMatch 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)Abelian groups(s)Finite automaton\begin{array}{|ll|ll|} \hline (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \text{Syntax trees} \\\hline (c) & \text{Code generation} & (r) & \text{Push down automaton} \\\hline (d) & \text{Abelian groups} & (s) & \text{Finite automaton} \\\hline \end{array}(a)(b)(c)(d)Lexical analysisCode optimizationCode generationAbelian groups(p)(q)(r)(s)DAG’sSyntax treesPush down automatonFinite automatonSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google