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 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.