Purdue Compiler-Construction Tool Set

(tool)(PCCTS) A highly integrated lexical analser generatorand parser generator by Terence J. Parr ,Will E. Cohen and Henry G. Dietz , bothof Purdue University.

ANTLR (ANother Tool for Language Recognition) corresponds toYACC and DLG (DFA-based Lexical analyser Generator) functionslike LEX. PCCTS has many additional features which make iteasier to use for a wide range of translation problems. PCCTSgrammars contain specifications for lexical and syntacticanalysis with selective backtracking ("infinite lookahead"),semantic predicates, intermediate-form construction anderror reporting. Rules may employ Extended BNF (EBNF)grammar constructs and may define parameters, return values,and have local variables.

Languages described in PCCTS are recognised via LLk parsersconstructed in pure, human-readable, C code. Selectivebacktracking is available to handle non-LL(k) constructs.PCCTS parsers may be compiled with a C++ compiler. PCCTSalso includes the SORCERER tree parser generator.

Latest version: 1.10, runs under Unix, MS-DOS, OS/2, andMacintosh and is very portable.

ftp://marvin.ecn.purdue.edu/pub/pccts/1.10.

UK FTP. Macintosh FTP.

Mailing list: pccts-users-request@ahpcrc.umn.edu ("subscribepccts-users your_name" in the message body).

E-mail: Terence J. Parr , Roberto Avanzi (Mac port).

单词	purdue compiler-construction tool set
释义	Purdue Compiler-Construction Tool Set Purdue Compiler-Construction Tool Set (tool)(PCCTS) A highly integrated lexical analser generatorand parser generator by Terence J. Parr ,Will E. Cohen and Henry G. Dietz , bothof Purdue University. ANTLR (ANother Tool for Language Recognition) corresponds toYACC and DLG (DFA-based Lexical analyser Generator) functionslike LEX. PCCTS has many additional features which make iteasier to use for a wide range of translation problems. PCCTSgrammars contain specifications for lexical and syntacticanalysis with selective backtracking ("infinite lookahead"),semantic predicates, intermediate-form construction anderror reporting. Rules may employ Extended BNF (EBNF)grammar constructs and may define parameters, return values,and have local variables. Languages described in PCCTS are recognised via LLk parsersconstructed in pure, human-readable, C code. Selectivebacktracking is available to handle non-LL(k) constructs.PCCTS parsers may be compiled with a C++ compiler. PCCTSalso includes the SORCERER tree parser generator. Latest version: 1.10, runs under Unix, MS-DOS, OS/2, andMacintosh and is very portable. ftp://marvin.ecn.purdue.edu/pub/pccts/1.10. UK FTP. Macintosh FTP. Mailing list: pccts-users-request@ahpcrc.umn.edu ("subscribepccts-users your_name" in the message body). E-mail: Terence J. Parr , Roberto Avanzi (Mac port).
随便看	catches them bang to rights catches the sun catches up catches up in catches us bang to rights catches with pants down catches with trousers down catches you bang to rights catches your fancy catch everyone being right catch eye catch fancy catch fire catch flat-footed catch flies catchflies catchfly catch forty winks catch from catch from her catch from him catch from me catch from one catch from them catch from us