tool: PCCTS (Purdue Compiler-Construction Tool Set)

---

Language:	BNF (Extended)
Version:	1.33
Parts:	scanner generator, parser generator (pred-LL(k)), documentation, tutorial
Author:	Terence J. Parr <parrt@parr-research.com>, Will E. Cohen <cohenw@ecn.purdue.edu>, Henry G. Dietz <hankd@ecn.purdue.edu>, Russell W. Quong <quong@ecn.purdue.edu>
Location:	ftp://ftp.parr-research.com/pub/pccts/ uk: ftp://src.doc.ic.ac.uk/computing/programming/languages/tools/pccts/
Description:	PCCTS is similar to a highly integrated version of YACC and LEX; where ANTLR (ANother Tool for Language Recognition) corresponds to YACC and DLG (DFA-based Lexical analyzer Generator) functions like LEX. PCCTS grammars contain specifications for lexical and syntactic analysis with selective backtracking ("infinite lookahead"), semantic predicates, intermediate-form construction and sophisticated parser exception handling. Rules may employ Extended BNF (EBNF) grammar constructs and may define parameters, return values and local variables. Languages described in PCCTS are recognized via predicated-LL(k) parsers constructed in pure, human-readable, C/C++ code; the C++ programming interface is very good. The documentation is complete, but distributed over an original manual plus multiple release notes. A book is in the works and should be available 1Q 1996. A recently-developed PCCTS-based C++ parser is available at the ftp://site; it is an *initial* release and was derived from the grammar built by NeXT, Inc..
Restriction:	The tool is totally public domain--it has no legal restrictions on its use or incorporation into commercial applications.
Ports:	Unix, DOS, Windows, OS/2, Macintosh, NeXT
Portability:	very high
Discussion:	comp.compilers.tools.pccts
Contact:	Terence J. Parr <parrt@acm.org>
Updated:	October 5th, 1995

language: BNF

category: compiler generators and related tools summary, or expanded.

category: text manipulation summary, or expanded.