语法分析器doc（Parser doc）.docVIP

语法分析器doc（Parser doc） parser The main task 1. Clear the principle and function of the parser 2. Understand the principle of top-down analysis 3. The input grammar can eliminate left recursion and extract public left factor 4. Find the non-end collection of grammar -- FIRST and FOLLOW 5. Give priority to input and construct operator precedence tables 1. Define the principles and functions of the parser Parser by accepting the lexical analysis program identify word string, determine whether or not they are produced by the grammar of a language, namely whether recognition strings is a grammar composition, syntax checking at the same time, in preparation for the back of the semantic analysis and code generation. Two. Understand the principle of top-down analysis method Top-down analysis is one of the two major categories of grammatical analytical and analytical methods, and a broad category is the bottom-up analysis method. Top-down analysis method, refers to the arbitrary input strings of symbols, in every possible way, from the root node, namely the identification symbols, from top to bottom according to the grammar for the input string to establish a syntax tree. The top-down analysis process is essentially a testing process, which repeatedly USES different rules to match the input string. So, why its called a top-down analysis, the reason is that this process starts with identifying symbols, and then builds a syntax tree. These analytical methods have two main features: 1. The analysis process is predicative, to predict the grammatical composition of the input symbol string, and then the grammar tree is established according to the grammar composition grammar. 2. The top-down analysis method can be divided into two categories: deterministic and non-deterministic. The analytical method of determination needs to be limited to grammar. This method is relatively simple and intuitive and is a common method. The undetermined analysis method is a test process for any input