11. The regular expression is an important notation for specifying ----------- Each pattern matches a set of strings, so regular expressions serve as a name for a set of strings. Programming languages tokens can be described by -....... 12. A regular language is defined by ------------, represented by -...... and recognized by ........... 13. Syntax analysis is the ...............-phase for both compilation and interpretation process. It is also known as ---------- 14. The Syntax analysis input is -- -----, but the output is -- 15. The parse tree represents higher-level constructs (statements, expressions, subroutines and so on). Each construct is a ------ ----------in the tree; its constituents are its ---- ---------- The root of the tree is ----- ----- --- The leaves from left to right are ------- ---received from the 16. The parse tree structure relies on a set of potentially ........... - known as a -- 17. Semantic analysis is 18. Using the ......, the semantic analyzer enforces a large variety of rules that are not captured by the hierarchical structure of the context-free grammar and the parse tree. 19. The semantic analyzer typically uses and maintains ..... ........... data structure that maps each identifier to the information known about it. This information includes the ..... -------------, and ---------- 20. Not all semantic rules can be checked at compile-time, as a result, there are two types of Semantic analysis known as ------ , and 21. ------------ ----------------- are the semantics rules that must be checked at run time (or in the later phases of an interpreter. 22. ---- ............--are the semantics rules that can be checked at compile-time (or in the front end of an interpreter)