Recursive subroutine method to design a syntax analysis program, top-down analysis. 1, using recursive descent parsing algorithm analysis of the expression grammar: exp:: = exp addop term | term addop:: =+ |- term:: = term mulop factor | factor mulop:: =* |/factor:: = (exp) | number of which is the number of decimal number can number string (integer can be), so here also need a small lexical analyzer to get the number value. 2, the lexical analyzer in subroutine form, when the need for lexical analysis of a call 3, able to recognize right and wrong expression 4, during the course of parsing, calculating import value of the expression.

语法分析器\语法分析器.dsp
..........\语法分析器.dsw
..........\语法分析器.plg
..........\语法分析.ncb
..........\语法分析.plg
..........\语法分析器.ncb
..........\语法分析器.opt
..........\Debug\vc60.idb
..........\.....\vc60.pdb
..........\.....\语法分析.pch
..........\.....\语法分析.obj
..........\.....\语法分析.pdb
..........\.....\语法分析.exe
..........\.....\语法分析.ilk
..........\语法分析.dsp
..........\语法分析.c
..........\语法分析.opt
..........\语法分析.dsw
..........\Debug
语法分析器

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．