DIRECTORY EDIFfing, EDIFGrammar, HashTable, Rope;EDIFSemantics: CEDAR DEFINITIONSIMPORTS Rope= {OPEN EDIFGrammar, EDIFfing;SyntaxError: SIGNAL [pt: ParseTree,msg: ROPE,severity: Severity _ error];Severity: TYPE = {warning, error};LORA: TYPE = LIST OF REF ANY;REFINT: TYPE = REF INT;MacroDef: TYPE = REF MacroDefPrivate;MacroDefPrivate: TYPE = RECORD [requiredFormals, optionalFormals, extraFormals: IdPtList _ NIL,okToSkipTail: BOOL _ FALSE,generators: ParseTreeGeneratorList _ NIL,comments: LIST OF LIST OF ROPE _ NIL];IdPtList: TYPE = LIST OF IdPt;IdPt: TYPE = REF identifier ParseTreePrivate;ParseTreeGeneratorList: TYPE = LIST OF ParseTreeGenerator;ParseTreeGenerator: TYPE = REF ParseTreeGeneratorPrivate;ParseTreeGeneratorPrivate: TYPE = RECORD [quaPT: ParseTree,variant: SELECT type: ParseTreeGeneratorType FROMliteral => [pt: ParseTree],name => [id: ATOM],buildList => [elts: ParseTreeGeneratorList],buildName => [id: ATOM],forEach => [domain: ATOMList, range: ParseTreeGeneratorList],index => [var: ATOM],ENDCASE];ParseTreeGeneratorType: TYPE = {literal, name, buildList, buildName, forEach, index};Semantics: TYPE = REF SemanticsPrivate;SemanticsPrivate: TYPE = RECORD [Before: Beforer _ NIL,After: Afterer _ NIL,PerSubResult: SubResultConsumer _ NIL,HandleSpecially: SpecialHandler _ NIL,FilterResult: ResultFilter _ NIL];Beforer: TYPE = PROC [parentContext: REF ANY, selfTree: ParseTree] RETURNS [context: REF ANY _ NIL];Afterer: TYPE =PROC [parentContext, context: REF ANY,selfTree: ParseTree,SetLevel: PROC [nLevel: Level, ups: NAT],DefineMacro: PROC [name: ATOM, def: MacroDef]]RETURNS [result: REF ANY _ NIL];SubResultConsumer: TYPE = PROC [parentContext, context, result: REF ANY, index: INT, subTree: ParseTree];ResultFilter: TYPE = PROC [subResult: REF ANY, subRule: Rule, nc: NamingContext] RETURNS [result: REF ANY];ResultOffTail: PROC = INLINE {};SpecialHandler: TYPE = PROC [ptl: ParseTreeList, parentTree: ParseTree, r, repeatSub: Rule, level: Level, onces: Onces, description: ROPE, sem: Semantics, context: REF ANY, SetLevel: PROC [nLevel: Level, ups: NAT], macros: HashTable.Table, ConsumeResult: PROC [res: REF ANY, pt: ParseTree], nc: NamingContext, keyword: ATOM] RETURNS [match: BOOL, ptail: ParseTreeList, result: REF ANY, lastWasStar: BOOL];TreeWork: PROC [ptl: ParseTreeList, parentTree: ParseTree, r, repeatSub: Rule, level: Level, onces: Onces, okToFail: BOOL, description: ROPE, sem: Semantics, context: REF ANY, SetLevel: PROC [nLevel: Level, ups: NAT], macros: HashTable.Table, ConsumeResult: PROC [res: REF ANY, pt: ParseTree], nc: NamingContext] RETURNS [match: BOOL, ptail: ParseTreeList, result: REF ANY];Onces: TYPE = HashTable.Table;NamingContext: TYPE = REF NamingContextPrivate;NamingContextPrivate: TYPE = RECORD [parent: NamingContext _ NIL,class: NamingContextClass,data: REF ANY _ NIL];NamingContextClass: TYPE = REF NamingContextClassPrivate;NamingContextClassPrivate: TYPE = RECORD [Lookup: PROC [nc: NamingContext, name: ATOM] RETURNS [found: BOOL, value: REF ANY],Define: PROC [nc: NamingContext, name: ATOM, value: REF ANY, re: BOOL _ FALSE]];Lookup: PROC [nc: NamingContext, name: ATOM] RETURNS [found: BOOL, value: REF ANY];Define: PROC [nc: NamingContext, name: ATOM, value: REF ANY, re: BOOL _ FALSE];CreateHashTableNamingContext: PROC [parent: NamingContext _ NIL] RETURNS [nc: NamingContext];DiscardResult: PROC [res: REF ANY, pt: ParseTree];SS: PROC [category: ATOM, semp: SemanticsPrivate];Traverse: PROC [pt: ParseTree, r: Rule, level: Level, description: ROPE, context: REF ANY _ NIL, macros: HashTable.Table _ NIL, nc: NamingContext _ NIL] RETURNS [match: BOOL, result: REF ANY _ NIL];AtomNameEq: PROC [n1, n2: ATOM] RETURNS [BOOL];RopeNameEq: PROC [n1, n2: ROPE] RETURNS [eq: BOOL]= INLINE {eq _ Rope.Equal[n1, n2, FALSE]};MakeAtomDict: PROC RETURNS [dict: HashTable.Table];MakeRopeDict: PROC RETURNS [dict: HashTable.Table];}.    ¼  EDIFSemantics.MesaSpreitzer, February 24, 1986 11:31:11 pm PSTups=1 sets level in construct containing this, and no more.index=1 for first thing seen = first thing after keyword.‌ت÷  –"cedar" styleک code™K™,—Kک Kڑدk	œ(ک1Kک ڑذbxœ‌œ‌ک Kڑ‌œکKڑœ‌œکKک ڑذblœ‌œکKڑœکKڑœ‌œک
KکKڑœک—Kک Kڑœ
‌œک"Kک Kڑ‌œ‌œ‌œ‌œ‌œ‌œکKڑ‌œ‌œ‌œ‌œکKک Kڑœ
‌œ‌œک%ڑœ‌œ‌œک Kڑœ;‌œک?Kڑœ‌œ‌œکKڑœ%‌œک)Kڑœ
‌œ‌œ‌œ‌œ‌œ‌ک$Kک—Kک Kڑœ
‌œ‌œ‌œکKڑœ‌œ‌œک-Kک Kڑœ‌œ‌œ‌œک:Kڑœ‌œ‌œک9ڑœ‌œ‌œک*Kڑœکڑœ	‌œ‌ک1KڑœکKڑœ‌œکKڑœ,ک,Kڑœ‌œکKڑœ=ک=Kڑœ‌œکKڑ‌ک—Kک—Kک Kڑœ‌œ9کUKک Kڑœ‌œ‌œک'ڑœ‌œ‌œک!Kڑœ‌œکKڑœ‌œکKڑœ"‌œک&Kڑœ"‌œک&Kڑœ‌ک Kک—Kک Kڑدnœ‌œ‌œ‌œ‌œ‌œ‌œ‌œ‌œکdڑœ	‌œکڑ‌œکKڑœ‌œ‌œک Kکڑ œ‌œدgœ‌œک)K™;—Kڑ œ‌œ‌œک-Kڑœک—Kڑ‌œ
‌œ‌œ‌œک —Kک ڑ œ‌œ‌œ"‌œ‌œ	‌œکiKڑœ9™9—Kک Kڑ œ‌œ‌œ‌œ‌œ$‌œ
‌œ‌œکkKک Kڑ œ‌œ‌œک Kک Kڑ( œ‌œ‌œj‌œ‌œ‌œ œ‌œ،œ‌œ œ‌œ‌œ‌œ.‌œ‌œ	‌œ ‌œ‌œ‌œک•Kک Kڑ$ œ‌œg‌œ‌œ‌œ‌œ œ‌œ،œ‌œ œ‌œ‌œ‌œ%‌œ	‌œ ‌œ‌œکِKک Kڑœ‌œکKک Kڑœ‌œ‌œک/ڑœ‌œ‌œک%Kڑœ‌œکKڑœکKڑœ‌œ‌œ‌œک—Kک Kڑœ‌œ‌œک9ڑœ‌œ‌œک*Kڑ œ‌œ‌œ‌œ	‌œ	‌œ‌œکSKڑ œ‌œ‌œ	‌œ‌œ‌œ‌œکNKک—Kک Kڑ œ‌œ‌œ‌œ	‌œ	‌œ‌œکSKڑ œ‌œ‌œ	‌œ‌œ‌œ‌œکOKک Kڑ œ‌œ‌œ‌œک]Kک Kڑ œ‌œ‌œ‌œک2Kک Kڑ‌œ‌œ‌œک2Kک Kڑ œ‌œ5‌œ‌œ‌œ‌œ‌œ‌œ‌œ	‌œ
‌œ‌œ‌œکئKک Kڑ
 
œ‌œ
‌œ‌œ‌œک/ڑ
 
œ‌œ
‌œ‌œ‌œک2Kڑœ‌œ‌œک*—Kک Kڑ œ‌œ‌œک3Kڑ œ‌œ‌œک3Kک Kک—— …—    ¤  W  