DIRECTORY Atom, EDIFAndCore, EDIFfing, EDIFParsing2, IO, Rope;EDIFParsing2Impl: CEDAR PROGRAMIMPORTS Atom, RopeEXPORTS EDIFParsing2= {OPEN EDIFAndCore, EDIFfing, EDIFParsing2;ParseError: PUBLIC ERROR [parseStack: ParseStack,nonTerminal: ATOM,syntaxRule: SyntaxRule]= CODE;Repeats: TYPE = REF SyntaxRuleList;NewRepeats: PROC RETURNS [r: Repeats] = {r _ NEW [SyntaxRuleList _ NIL]};In: PROC [sr: SyntaxRule, rs: Repeats] RETURNS [in: BOOL] = {FOR srl: SyntaxRuleList _ rs^, srl.rest WHILE srl # NIL DOIF srl.first = sr THEN RETURN [TRUE];ENDLOOP;};Insert: PROC [sr: SyntaxRule, rs: Repeats] = {rs^ _ CONS[sr, rs^]};Register: PUBLIC PROC [outerKey: ATOM _ NIL,key: ATOM,start: PROC [outerKey, key: ATOM, name: NameStuff, outerConv: REF ANY] RETURNS [conv: REF ANY] _ NIL,finish: PROC [conv: REF ANY] _ NIL,rule: SyntaxRule]= {};FetchRule: PROC [category: ATOM] RETURNS [sr: SyntaxRule] = {ERROR --not yet implemented--;};Check: PROC [ptl: ParseTreeList, rule: SyntaxRule, repeats: Repeats, insist: BOOL, nonTerminal: ATOM, ps: ParseStack] RETURNS [outsist, ok: BOOL, ptr: ParseTreeList] = {i0: INT = ps.first.index;outsist _ insist;WITH rule SELECT FROMx: REF SyntaxRulePrivate.terminal => {ok _ FALSE;WITH x SELECT FROMz: REF SyntaxRulePrivate.terminal.any => ok _ TRUE;z: REF SyntaxRulePrivate.terminal.string => ok _ ptl.first.type = string;z: REF SyntaxRulePrivate.terminal.identifier => ok _ ptl.first.type = identifier;z: REF SyntaxRulePrivate.terminal.integer => WITH ptl.first SELECT FROMy: REF ParseTreePrivate.integer => ok _ z.min <= y.i AND y.i <= z.max;ENDCASE;z: REF SyntaxRulePrivate.terminal.keyword => WITH ptl.first SELECT FROMy: REF ParseTreePrivate.identifier => ok _ z.key.Equal[Atom.GetPName[y.id], FALSE];ENDCASE;ENDCASE => ERROR;IF ok THEN {ptr _ ptl.rest; ps.first.index _ ps.first.index + 1};};x: REF SyntaxRulePrivate.nonTerminal => {sr: SyntaxRule _ FetchRule[x.category];[outsist, ok, ptr] _ Check[ptl, sr, repeats, insist, x.category, ps];};x: REF SyntaxRulePrivate.choice => {ok _ FALSE;FOR rl: SyntaxRuleList _ x.choices, rl.rest WHILE rl # NIL AND NOT ok DO[, ok, ptr] _ Check[ptl, rl.first, repeats, FALSE, nonTerminal, ps];ENDLOOP;};x: REF SyntaxRulePrivate.repeat => {once: BOOL _ FALSE;ptr _ ptl;ok _ TRUE;WHILE ptr # NIL AND ok DO[, ok, ptr] _ Check[ptr, x.r, repeats, insist AND x.atLeastOnce AND NOT once, nonTerminal, ps];IF ok THEN once _ TRUE;ENDLOOP;ok _ once OR NOT x.atLeastOnce;};x: REF SyntaxRulePrivate.series => {ptr _ ptl;ok _ TRUE;FOR rl: SyntaxRuleList _ x.elts, rl.rest WHILE rl # NIL AND ok DO[outsist, ok, ptr] _ Check[ptr, rl.first, NewRepeats[], outsist, nonTerminal, ps];ENDLOOP;};x: REF SyntaxRulePrivate.optional => {[outsist, ok, ptr] _ Check[ptl, x.r, repeats, FALSE, nonTerminal, ps];IF NOT ok THEN {ok _ TRUE; outsist _ insist; ptr _ ptl};};x: REF SyntaxRulePrivate.nest => {WITH ptl.first SELECT FROMy: REF ParseTreePrivate.list => {sps: ParseStack = CONS[[y, 0], ps];subl: ParseTreeList; --note that EDIF documents randomly allege that we can discard trailing stuff not consumed in currently understood grammar.[outsist, ok, subl] _ Check[y.children, x.r, NewRepeats[], insist, nonTerminal, sps];IF ok THEN ptr _ ptl.rest;};ENDCASE => ok _ FALSE;};x: REF SyntaxRulePrivate.atMostOne => {SELECT In[x.r, repeats] FROMFALSE => {[outsist, ok, ptr] _ Check[ptl, x.r, NewRepeats[], insist, nonTerminal, ps];IF ok THEN Insert[x.r, repeats];};TRUE => ok _ FALSE;ENDCASE => ERROR;};x: REF SyntaxRulePrivate.cut => {ok _ outsist _ TRUE;ptr _ ptl;};ENDCASE => ERROR;IF NOT ok THEN {ptr _ ptl; ps.first.index _ i0; outsist _ insist};IF ok OR NOT insist THEN RETURN;ERROR ParseError[parseStack: ps,nonTerminal: nonTerminal,syntaxRule: rule];};}.   H  EDIFParsing2Impl.MesaSpreitzer, February 13, 1986 4:46:26 pm PST‌تn  –"cedar" styleک code™K™+—Kک Kڑدk	œ,‌œک>Kک ڑذbxœ‌œ‌کKڑ‌œکKڑ‌œکKڑœ‌œ%ک,Kک ڑذbl
ک
ڑœ‌œ‌œکKکKڑœ‌œکKڑœک—Kڑœ‌œک—Kک Kڑœ	‌œ‌œک#Kک Kڑ
دn
œ‌œ‌œ‌œ‌œکIKک ڑ œ‌œ‌œ‌œک=ڑ‌œ%‌œ‌œ‌ک:Kڑ‌œ‌œ‌œ‌œک%Kڑ‌œک—Kک—Kک Kڑ œ‌œ(‌œکCKک ڑœکڑœ‌œ‌œکKڑœ
‌œ‌œکKڑœ‌œک
Kڑœ‌œ‌œ‌œ‌œ‌œ‌œ‌œ‌œکeKڑ	œ‌œ‌œ‌œ‌œک#KکKک—کKک——Kک ڑ 	œ‌œ‌œ‌œک=Kڑ‌œدcœکKک—Kک ڑ œ‌œB‌œ‌œ‌œ‌œک©Kڑœ‌œکKکڑ‌œ‌œ‌کڑœ‌œ ک&Kڑœ‌œکڑ‌œ‌œ‌کKڑœ‌œ(‌œک3Kڑœ‌œCکIKڑœ‌œKکQڑœ‌œ'‌œ‌œ‌کGKڑœ‌œ/‌œکFKڑ‌œک—ڑœ‌œ'‌œ‌œ‌کGKڑœ‌œF‌œکSKڑ‌œک—Kڑ‌œ‌œک—Kڑ‌œ‌œ7کAKک—ڑœ‌œ#ک)Kک'KکEKک—ڑœ‌œک$Kڑœ‌œکڑ‌œ)‌œ‌œ‌œ‌œ‌کHKڑœ,‌œکDKڑ‌œک—Kک—ڑœ‌œک$Kڑœ‌œ‌œکKک
Kڑœ‌œک
ڑ‌œ‌œ‌œ‌کKڑœ.‌œ‌œ‌œک_Kڑ‌œ‌œ‌œکKڑ‌œک—Kڑœ
‌œ‌œکKک—ڑœ‌œک$Kک
Kڑœ‌œک
ڑ	‌œ&‌œ‌œ‌œ‌کAKڑœRکRKڑ‌œک—Kک—ڑœ‌œ ک&Kڑœ.‌œکFKڑ‌œ‌œ‌œ‌œک8Kک—ڑœ‌œک"ڑ‌œ‌œ‌کڑœ‌œک!Kڑœ‌œک#Kڑœ،{کگKڑœUکUKڑ‌œ‌œکKک—Kڑ‌œ	‌œک—Kک—ڑœ‌œ!ک'ڑ‌œ‌کڑ‌œک
KڑœLکLKڑ‌œ‌œک Kک—Kڑ‌œ	‌œکKڑ‌œ‌œک—Kک—ڑœ‌œک!Kڑœ‌œکKک
Kک—Kڑ‌œ‌œک—Kڑ‌œ‌œ‌œ4کBKڑ
‌œ‌œ‌œ‌œ‌œک ڑ‌œکKکKکKک—Kک—Kک Kک—— …—    î  ¤  