The recursive descent parser constructor to each nonterminal grammar, are based on the production structure of each candidate, its preparation of a corresponding subroutine (or function), the subroutine is completed appropriate the nonterminal symbol corresponding syntax component identification and analysis tasks. Therefore, the recursive descent parser parsing subroutine is a nonterminal string of symbols, the right part of the rules to match the input string. The analysis process is a top-down level grammar rules call the subroutine. The system uses a recursive descent analysis methods.

lexer
.....\lexer
.....\.....\debug
.....\.....\.....\lexer.exe
.....\.....\.....\lexer.pch
.....\.....\.....\test.pch
.....\.....\.....\vc60.idb
.....\.....\.....\vc60.pdb
.....\.....\lexer.cpp
.....\.....\lexer.dsp
.....\.....\lexer.dsw
.....\.....\lexer.ncb
.....\.....\lexer.opt
.....\.....\lexer.plg
.....\.....\lexer.sln
.....\.....\lexer.suo
.....\.....\lexer.vcproj
.....\.....\run.bat
.....\.....\test.c
.....\.....\test.c.output.txt
.....\.....\test.dsp
.....\.....\test.dsw
.....\.....\test.ncb
.....\.....\test.opt
.....\.....\test.plg

• 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．