< tool > A simple tree parser generator by Terence Parr parrt@s1.arc.umn.edu .
SORCERER is suitable for 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 parser s that, in contrast to code generators, may execute actions at any point during a tree walk. SORCERER accepts extended BNF notation, allows predicate s 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.
SORCERER is included in the Purdue Compiler-Construction Tool Set .
Version: 1.00B
ftp://marvin.ecn.purdue.edu/pub/pccts/sorcerer/ .
E-mail: parrt@acm.org ("e-mail sor.tar.Z.uu" in subject).
Mailing list: pccts-users-request@ahpcrc.umn.edu (message body: "subscribe pccts-users YOUR-NAME", where YOUR-NAME can be your name or e-mail address).
(1994-02-15)