A simple tree parser generator by Terence Parr <[email protected]>.

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.

SORCERER is included in the Purdue Compiler-Construction Tool Set.

Version: 1.00B

E-mail: <[email protected]> ("e-mail sor.tar.Z.uu" in subject).

Mailing list: [email protected] (message body: "subscribe pccts-users YOUR-NAME", where YOUR-NAME can be your name or e-mail address).

Last updated: 1994-02-15

Nearby terms:

SONETSony PlaystationSORCERERsorcerer's apprentice modesort

Try this search on Wikipedia, OneLook, Google

sorcerer's apprentice mode


(From Johann Wolfgang von Goethe's "Der Zauberlehrling", via the Walt Disney film "Fantasia") A bug in a protocol where, under some circumstances, the receipt of a message causes multiple messages to be sent, each of which, when received, triggers the same bug. Used especially of such behaviour caused by bounce message loops in electronic mail software.

Compare broadcast storm, network meltdown, software laser, ARMM.

Der Zauberlehrling.

[Jargon File]

Last updated: 1999-10-08

Nearby terms:

Sony PlaystationSORCERERsorcerer's apprentice modesortsorting

Try this search on Wikipedia, OneLook, Google


<application, algorithm>

1. To arrange a collection of items in some specified order. The items - records in a file or data structures in memory - consist of one or more fields or members. One of these fields is designated as the "sort key" which means the records will be ordered according to the value of that field. Sometimes a sequence of key fields is specified such that if all earlier keys are equal then the later keys will be compared. Within each field some ordering is imposed, e.g. ascending or descending numerical, lexical ordering, or date.

Sorting is the subject of a great deal of study since it is a common operation which can consume a lot of computer time. There are many well-known sorting algorithms with different time and space behaviour and programming complexity.

Examples are quicksort, insertion sort, bubble sort, heap sort, and tree sort. These employ many different data structures to store sorted data, such as arrays, linked lists, and binary trees.


2. The Unix utility program for sorting lines of files.

Unix manual page: sort(1).

Last updated: 1997-02-12

Nearby terms:

Sony PlaystationSORCERERsorcerer's apprentice modesortsortingSOSsound

Try this search on Wikipedia, OneLook, Google



Nearby terms:

sorcerer's apprentice modesortsortingSOSsoundSound Blaster

Try this search on Wikipedia, OneLook, Google