Description: The basic idea of recursive descent:
For each non-terminal construct a subroutine, each subroutine of the process of the body produced by the sub-type of candidate to undertake encountered terminator direct match, while the case of non-terminal symbol on the call to the corresponding non-terminal symbol of the subroutine. The analysis from the grammar start symbol of the subroutine call to start until all the non-terminal and launched as a terminator and get matched up. If the analysis process to achieve this step indicates that the analysis of success, or else that there is a syntax error input. Recursive descent analysis of the grammar of the restrictions can not have public left factor and left recursion. As the grammar is a recursive definition, and therefore also a recursive subroutine, known as recursive descent subprogram.
File list (Check if you may need any files):
新建文本文档.txt
Download