| OCR Text |
Show . ____. , . .III;I l ■ 48 save a great deal of effort in writing the syntactic algorithm. The multiply operators provide an example; they arfe usually assigned the same level of precedence and this fact can be indicated in SCRIBE by the class assignment: mop *-■•{ ("•*" ,."/"," T" ) , This provides an abbreviation or "parse name!' for the three delimeters. In fact, every terminal symbol can be considered to have both an "external name", which is the character itself, and a "parse nanie'r ! which is either the same as the external name or is a meta symbol indicating membership in a class. All comparisons in the syntax section are done on the parse name. Pragmatics A table is built from the indicated relationships so that the textual scanner may separate the terminal' symbols, and discover their external and parse names. Justification The terminal declaration supplies a finite state algorithm in the machine with enough information to completely strip down the text into primary syntactic atoms which is typically the dirtiest 30b in compiling. Examples: '''from both sections--to declare all symbols necessary for handling arithmetic expressions'1' |
