tool: SORCERER: A Simple Tree Parser and Rewrite Generator

---

Language:	BNF (extended)
Version:	1.00B15
Parts:	translator, documentation, tutorial, examples
Author:	Terence Parr <parrt@parr-research.com>, Aaron Sawdey <sawdey@lcse.umn.edu>, Gary Funck <gary@intrepid.com>
Location:	ftp://ftp.parr-research.com/pub/pccts/sorcerer/ ftp://ftp.uu.net/languages/tools/pccts/ uk: ftp://src.doc.ic.ac.uk/computing/programming/languages/tools/pccts/ europe: ftp://ftp.th-darmstadt.de/pub/programming/languages/compiler-compiler/pccts/
Description:	SORCERER is more suitable for the class of translation problems lying between those solved by code-generator generators and by full source-to-source translator generators. SORCERER generates simple, flexible, top-down, tree parsers that, in contrast to code-generators, may execute actions at any point during a tree walk. SORCERER accepts extended BNF notation, allows predicates to direct the tree walk with semantic and syntactic context information, and does not rely on any particular intermediate form, parser generator, or other pre-existing application. Both C and C++ based tree walkers can be generated. SORCERER is well integrated with PCCTS (soon SORCERER will be distributed with PCCTS).
Reference:	Several listed in software documentation. A book will available first quarter 1996; a pre-release version is available at the ftp site.
Discussion:	Usenet newsgroup comp.compilers.tools.pccts
Help:	newsgroup
Support:	actively supported, from newsgroup and Parr Research Corporation <parrt@parr-research.com>.
Updated:	September 1st, 1995

language: BNF

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

category: text manipulation summary, or expanded.