Analysing
Parsing
Translating
Recognizing
One pass compiler
multipass compiler
croos compiler
optimizing compiler
Finite automata
Regular expressions
Context free grammar
Both a and b
Hamiltonian graph
Control graph
Flow graph
DAG
Analysis part
Lexical part
Synthesis part
None of these
Accepts a program written in a high level language and produces an object program
Appears to execute a source program as if it were machine language
Automates the translation of assembly language into machine language
Places programs into memory and prepares them for execution
High level language
Low level language
Regular grammar
Push down automata
Finite state automata
2-way linear bounded automata
All of the above
Top-down parsing
Recursive-descent parsing
Predictive parsing
Both (b) and (c)
Machine code, mnemonic
Tokens, source code
Source code, tokens