PURDUE COMPILER-CONSTRUCTION TOOL SET

Domain	Definition
Computing	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. (ftp://marvin.ecn.purdue.edu/pub/pccts/1.10). 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). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Hexadecimal (or equivalents, 770AD-1900s) (references)

50 55 52 44 55 45 43 4F 4D 50 49 4C 45 52 2D 43 4F 4E 53 54 52 55 43 54 49 4F 4E 54 4F 4F 4C 53 45 54

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

01010000 01010101 01010010 01000100 01010101 01000101 00100000 01000011 01001111 01001101 01010000 01001001 01001100 01000101 01010010 00101101 01000011 01001111 01001110 01010011 01010100 01010010 01010101 01000011 01010100 01001001 01001111 01001110 00100000 01010100 01001111 01001111 01001100 00100000 01010011 01000101 01010100

HTML Code (1990) (references)

&#80 &#85 &#82 &#68 &#85 &#69 &#32 &#67 &#79 &#77 &#80 &#73 &#76 &#69 &#82 &#45 &#67 &#79 &#78 &#83 &#84 &#82 &#85 &#67 &#84 &#73 &#79 &#78 &#32 &#84 &#79 &#79 &#76 &#32 &#83 &#69 &#84

ISO 10646 (1991-1993) (references)

0050 0055 0052 0044 0055 0045 0043 004F 004D 0050 0049 004C 0045 0052 002D 0043 004F 004E 0053 0054 0052 0055 0043 0054 0049 004F 004E 0054 004F 004F 004C 0053 0045 0054

Encryption (beginner's substitution cypher): (references)

PURDUE COMPILER-CONSTRUCTION TOOL SET

Specialty Definition: PURDUE COMPILER-CONSTRUCTION TOOL SET

Computing

Crosswords: PURDUE COMPILER-CONSTRUCTION TOOL SET

Alternative Orthography: PURDUE COMPILER-CONSTRUCTION TOOL SET

50 55 52 44 55 45 43 4F 4D 50 49 4C 45 52 2D 43 4F 4E 53 54 52 55 43 54 49 4F 4E 54 4F 4F 4C 53 45 54

&#80 &#85 &#82 &#68 &#85 &#69 &#32 &#67 &#79 &#77 &#80 &#73 &#76 &#69 &#82 &#45 &#67 &#79 &#78 &#83 &#84 &#82 &#85 &#67 &#84 &#73 &#79 &#78 &#32 &#84 &#79 &#79 &#76 &#32 &#83 &#69 &#84

0050 0055 0052 0044 0055 0045 0043 004F 004D 0050 0049 004C 0045 0052 002D 0043 004F 004E 0053 0054 0052 0055 0043 0054 0049 004F 004E 0054 004F 004F 004C 0053 0045 0054

50555238553923749475043463952153749485354525537544349482544949462533954

INDEX