Purdue Compiler-Construction Tool Set
(PCCTS) A highly integrated lexical analser generator and parser generator by Terence J. Parr , Will E. Cohen and Henry G. Dietz , both of Purdue University. ANTLR (ANother Tool for Language Recognition) corresponds to YACC and DLG (DFA-based Lexical analyser Generator) functions like LEX. PCCTS has many additional features which make it easier to use for a wide range of translation problems. PCCTS grammars contain specifications for lexical and syntactic analysis with selective backtracking ("infinite lookahead"), semantic predicates, intermediate-form construction and error 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 parsers constructed in pure, human-readable, C code. Selective backtracking is available to handle non-LL(k) constructs. PCCTS parsers may be compiled with a C++ compiler. PCCTS also includes the SORCERER tree parser generator. Current version: 1.10, runs under Unix, MS-DOS, OS/2, and Macintosh and is very portable. . {UK FTP (ftp://src.doc.ic.ac.uk/ computing/programming/languages/tools/pccts/)}. {Macintosh FTP (ftp://maya.dei.unipd.it/pub/mac/)}. Mailing list: pccts-users-request@ahpcrc.umn.edu ("subscribe pccts-users your_name" in the message body). E-mail: Terence J. Parr , Roberto Avanzi (Mac port). (2000-10-30) In addition suitable contents:
[ 2 ] [ = ] [ @ ] [ ad ] [ ag ] [ ai ] [ al ] [ am ] [ an ] [ ANother Tool for Language Recognition ] [ ANTLR ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ B ] [ b ] [ ba ] [ backtracking ] [ base ] [ be ] [ BNF ] [ bo ] [ bot ] [ bs ] [ by ] [ C ] [ C++ ] [ ca ] [ cat ] [ cc ] [ CE ] [ CER ] [ ch ] [ ci ] [ ck ] [ cl ] [ cm ] [ cn ] [ co ] [ code ] [ com ] [ compiler ] [ computing ] [ con ] [ cons ] [ cr ] [ CT ] [ CTS ] [ D ] [ dd ] [ de ] [ DFA ] [ DLG ] [ do ] [ doc ] [ DOS ] [ du ] [ E ] [ EBNF ] [ ec ] [ ed ] [ edu ] [ ee ] [ eg ] [ ER ] [ er ] [ era ] [ error ] [ es ] [ et ] [ Extended BNF ] [ feature ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ FT ] [ FTP ] [ function ] [ G ] [ ge ] [ gen ] [ gh ] [ gn ] [ gr ] [ grammar ] [ gu ] [ h ] [ handle ] [ hr ] [ hu ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ infinite ] [ int ] [ io ] [ is ] [ it ] [ J ] [ K ] [ ke ] [ ki ] [ la ] [ language ] [ Lex ] [ LG ] [ li ] [ list ] [ LL ] [ local variable ] [ ls ] [ lu ] [ ly ] [ M ] [ ma ] [ Mac ] [ mail ] [ man ] [ message ] [ meter ] [ mm ] [ mn ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ MS-DOS ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ no ] [ Nother ] [ nr ] [ ns ] [ NT ] [ nz ] [ O ] [ om ] [ OR ] [ org ] [ OS ] [ OS/2 ] [ pa ] [ param ] [ parameter ] [ parser ] [ parser generator ] [ PC ] [ PCCTS ] [ pe ] [ ph ] [ pl ] [ port ] [ portable ] [ porting ] [ pr ] [ program ] [ programming ] [ Purdue University ] [ query ] [ ques ] [ range ] [ rc ] [ RE ] [ re ] [ ro ] [ ru ] [ run ] [ S ] [ sa ] [ sc ] [ se ] [ sh ] [ si ] [ sit ] [ sl ] [ SO ] [ so ] [ SORCERER ] [ spec ] [ specification ] [ sr ] [ st ] [ struct ] [ su ] [ subscribe ] [ sy ] [ T ] [ table ] [ th ] [ to ] [ tool ] [ tp ] [ tr ] [ track ] [ tracking ] [ tree ] [ TS ] [ tz ] [ ua ] [ uk ] [ um ] [ us ] [ user ] [ va ] [ value ] [ var ] [ variable ] [ ve ] [ version ] [ vi ] [ X ] [ Y ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (15370 Reads) |
