1. Context-free grammars are used for syntax analysis. a) True b) False 2. Compilation is translation from one language into another a) True b) False 3. Parsing is the process of dividing the program into tokens. a) True b) False 4. Many compiled languages have interpreted pieces. a) True b) False The grammaris set of rules that say how to build a parse tree a) True b) False 6. A regular expression can be a single character or digit. a) True b) False 7. Non-terminals are the smallest units of syntax. a) True b) False 8. The tokens are the tree-building rules. a) True b) False 9. A grammar is said to be ambiguous when it generates one parse tree. a) True b) False 10. Syntax analysis is the discovery of meaning in the program a) True b) False