DIRECTORY
IO,
NPGS1 USING [ActionSeq, AssignDescriptors, ErrorContext, Index, InstallScanTable, LinkSeq,  LinkStack, NextToken, nullValue, ProcessQueue, ResetScanIndex, ScanInit, ScanReset, ScanStats, StateSeq, StateStack, Token, TokenValue, Value, ValueSeq, ValueStack],
NPGSParseTable USING [ActionEntry, ActionTag, defaultMarker, endMarker, finalState, IndexTableRef, initialState, initialSymbol, InitIndexTable, InitNActions, InitNLengths, InitNStarts, InitNSymbols, InitNTDefaults, InitProdData, InitTActions, InitTLengths, InitTStarts, InitTSymbols, InitVocabulary, NActionsRef, NLengthsRef, NStartsRef, NSymbolsRef, NTDefaultsRef, NTIndex, NTState, NTSymbol, ProdDataRef, State, TActionsRef, TIndex, TLengthsRef, TStartsRef, TSymbol, TSymbolsRef, VocabularyRef];

NPGSParser: CEDAR PROGRAM 
IMPORTS IO, NPGS1, NPGSParseTable
EXPORTS NPGS1
= { 


vocabIndex: NPGSParseTable.IndexTableRef Ź NIL;
vocabBody: NPGSParseTable.VocabularyRef Ź NIL;


tStart: NPGSParseTable.TStartsRef;
tLength: NPGSParseTable.TLengthsRef;
tSymbol: NPGSParseTable.TSymbolsRef;
tAction: NPGSParseTable.TActionsRef;


nStart: NPGSParseTable.NStartsRef;
nLength: NPGSParseTable.NLengthsRef;
nSymbol: NPGSParseTable.NSymbolsRef;
nAction: NPGSParseTable.NActionsRef;
ntDefaults: NPGSParseTable.NTDefaultsRef;


prodData: NPGSParseTable.ProdDataRef;

InstallParseTable: PUBLIC PROC = {
IF prodData = NIL THEN {
tStart Ź NPGSParseTable.InitTStarts[];
tLength Ź NPGSParseTable.InitTLengths[];
tSymbol Ź NPGSParseTable.InitTSymbols[];
tAction Ź NPGSParseTable.InitTActions[];
nStart Ź NPGSParseTable.InitNStarts[];
nLength Ź NPGSParseTable.InitNLengths[];
nSymbol Ź NPGSParseTable.InitNSymbols[];
nAction Ź NPGSParseTable.InitNActions[];
ntDefaults Ź NPGSParseTable.InitNTDefaults[];
prodData Ź NPGSParseTable.InitProdData[];
NPGS1.InstallScanTable[];
};
};

errorLimit: NAT = 25;

scanTag: NPGSParseTable.ActionTag = [FALSE, 0];

inputSymbol: NPGSParseTable.TSymbol;

Input: PROC RETURNS [token: NPGS1.Token];
inputLoc: NPGS1.Index Ź 0;
inputValue: NPGS1.Value;

lastToken: NPGS1.Token;
nullSymbol: NPGSParseTable.TSymbol = 0;

s: NPGS1.StateStack;
l: NPGS1.LinkStack;
v: REF  NPGS1.ValueSeq;
top: CARDINAL;

q: REF NPGS1.ActionSeq;
qI: CARDINAL;


InputLoc: PUBLIC PROC RETURNS[NPGS1.Index] = {RETURN[inputLoc]};

Parse: PUBLIC PROC[
source: IO.STREAM,
logger: PROC[PROC[log: IO.STREAM]],
prefixOk: BOOL, cusp: BOOL]
RETURNS[complete: BOOL, nTokens, nErrors: NAT] = {
currentState: NPGSParseTable.State;
i, valid, m: CARDINAL;		-- stack pointers
action: NPGSParseTable.ActionEntry;

ParseInit: PROC = {
NPGS1.ScanInit[source, logger];
s Ź NIL;
q Ź NIL;
ExpandStack[500];
q Ź NIL;
ExpandQueue[250];
scanBuffer Ź NIL;
};

ParseReset: PROC = {
EraseQueue[];
EraseStack[];
IF scanBuffer # NIL THEN FREE[@scanBuffer];
NPGS1.ScanReset[];
};

ParseInit[];

{	-- ENABLE scope
ENABLE UNWIND => {ParseReset[]};
Input Ź NPGS1.NextToken;
nErrors Ź 0;  complete Ź TRUE;
i Ź top Ź valid Ź 0;  qI Ź 0;
s[0] Ź currentState Ź NPGSParseTable.initialState;
lastToken.class Ź nullSymbol;
inputSymbol Ź NPGSParseTable.initialSymbol;
inputValue.s Ź NPGS1.nullValue;
inputLoc Ź 0;

UNTIL currentState = NPGSParseTable.finalState AND (prefixOk OR (inputSymbol = NPGSParseTable.endMarker)) DO
{
tI: NPGSParseTable.TIndex Ź tStart[currentState];
FOR tI IN [tI .. tI + tLength[currentState]) DO
SELECT tSymbol[tI] FROM inputSymbol, NPGSParseTable.defaultMarker => EXIT ENDCASE;
REPEAT
FINISHED => GO TO SyntaxError;
ENDLOOP;

action Ź tAction[tI]; 
IF ~action.tag.reduce THEN TRUSTED { -- scan or scan reduce entry
IF qI > 0 THEN {
FOR k: CARDINAL IN (valid..i] DO s[k] Ź s[top+(k-valid)] ENDLOOP;
NPGS1.ProcessQueue[qI, top, cusp];  qI Ź 0
};
IF (top Ź valid Ź i Ź i+1) >= s.length THEN ExpandStack[256];
lastToken.class Ź inputSymbol; v[i] Ź inputValue; l[i] Ź inputLoc;
[[inputSymbol, inputValue, inputLoc]]  Ź Input[]
};

WHILE action.tag # scanTag DO
IF qI >= q.length THEN ExpandQueue[256];
q[qI] Ź action;  qI Ź qI + 1;
i Ź i-action.tag.pLength;
currentState Ź s[IF i > valid THEN top+(i-valid) ELSE (valid Ź i)]; {
lhs: NPGSParseTable.NTSymbol = prodData[action.transition].lhs;
IF currentState <= NPGSParseTable.NTState.LAST THEN {
nI: NPGSParseTable.NTIndex Ź nStart[currentState];
FOR nI IN [nI..nI+nLength[currentState]) DO
IF lhs = nSymbol[nI] THEN {action Ź nAction[nI]; GO TO nFound};
ENDLOOP
};
action Ź ntDefaults[lhs];
EXITS
nFound => NULL;
};
i Ź i+1;
ENDLOOP;
IF (m Ź top+(i-valid)) >= s.length THEN ExpandStack[256];
s[m] Ź currentState Ź action.transition;
EXITS
SyntaxError => TRUSTED {
lastToken.value Ź v[top];  lastToken.index Ź l[top];
top Ź top - 1;
complete Ź SyntaxError[logger, (nErrorsŹnErrors+1)>errorLimit]; 
i Ź valid Ź top;  qI Ź 0;  lastToken.class Ź nullSymbol;
currentState Ź s[i];
[[inputSymbol, inputValue, inputLoc]] Ź Input[];
IF ~complete THEN EXIT
};
};
ENDLOOP;

NPGS1.ProcessQueue[qI, top, cusp];
nErrors Ź nErrors + ([nTokens: nTokens] Ź NPGS1.ScanStats[]).nErrors;
};	-- of ENABLE scope

ParseReset[];
};


ExpandStack: PROC[delta: NAT] = {
oldSize: NAT = (IF s = NIL THEN 0 ELSE s.length);
newSize: NAT = oldSize + delta;
newS: NPGS1.StateStack = NEW[NPGS1.StateSeq[newSize]];
newL: NPGS1.LinkStack = NEW[NPGS1.LinkSeq[newSize]];
newV: NPGS1.ValueStack = NEW[NPGS1.ValueSeq[newSize]];
FOR i: NAT IN [0..oldSize) DO TRUSTED {
newS[i] Ź s[i]; newL[i] Ź l[i]; newV[i] Ź v[i]
};
ENDLOOP;
EraseStack[];
s Ź newS;  l Ź newL;  v Ź newV;
NPGS1.AssignDescriptors[qd:q, vd:v, ld:l, pp:prodData];
};

EraseStack: PROC = {
IF s # NIL THEN {FREE[@v];  FREE[@l];  FREE[@s]};
};

ExpandQueue: PROC[delta: NAT] = {
oldSize: NAT = (IF q = NIL THEN 0 ELSE q.length);
newSize: NAT = oldSize + delta;
newQ: REF NPGS1.ActionSeq = NEW[NPGS1.ActionSeq[newSize]];
FOR i: NAT IN [0..oldSize) DO newQ[i] Ź q[i] ENDLOOP;
q Ź newQ;
NPGS1.AssignDescriptors[qd:q, vd:v, ld:l, pp:prodData];
};

EraseQueue: PROC = {IF q # NIL THEN FREE[@q]};


errorStream: IO.STREAM Ź NIL;

minScanLimit: NAT = 4;
maxScanLimit: NAT = 12;
insertLimit: NAT = 2;
discardLimit: NAT = 10;
treeSize: NAT = 250;
checkSize: NAT = maxScanLimit+insertLimit+2;


track: BOOL = FALSE;

DisplayNode: PROC[n: NodeIndex] = {
IF track THEN {
errorStream.PutRope["::new node::"];
errorStream.Put[IO.char['\t], IO.int[n]];
errorStream.Put[IO.char['\t], IO.int[tree[n].father]]; 
errorStream.Put[IO.char['\t], IO.int[tree[n].last]];
errorStream.Put[IO.char['\t], IO.int[tree[n].state]];
errorStream.PutChar['\t]; TypeSym[tree[n].symbol];
errorStream.PutChar['\n];
};
};


NodeIndex: TYPE = NAT [0..treeSize);
nullIndex: NodeIndex = 0;

StackNode: TYPE = RECORD[
father: NodeIndex,
last: NodeIndex,
state:  NPGSParseTable.State,
symbol: NPGSParseTable.TSymbol,
aLeaf, bLeaf: BOOL,
link: NodeIndex];

TreeSpace: TYPE = ARRAY [0..treeSize) OF StackNode;
tree: REF TreeSpace;
nextNode: NAT [0..treeSize] Ź 0;
maxNode: NodeIndex Ź 0;
treeLimit: NAT [0..treeSize] Ź 0;
TreeFull: ERROR = CODE;

Allocate: PROC[parent, pred: NodeIndex, terminal: NPGSParseTable.TSymbol, stateNo: NPGSParseTable.State]
RETURNS [index: NodeIndex] = {
IF (index Ź nextNode) >= treeLimit THEN ERROR TreeFull[];
maxNode Ź MAX[index, maxNode];
tree[index] Ź StackNode[
father: parent,
last: pred,
state: stateNo,
symbol: terminal,
aLeaf: FALSE, bLeaf: FALSE,
link: nullIndex];
nextNode Ź nextNode+1;
};

hashSize: NAT = 250;	-- should depend on state count ?
HashIndex: TYPE = [0..hashSize);
HashSpace: TYPE = ARRAY HashIndex OF NodeIndex;
hashTable: REF HashSpace;

HashValue: PROC[s: NPGSParseTable.State] RETURNS[HashIndex] = INLINE {
RETURN[s MOD hashSize];
};

ParsingMode: TYPE = {aTree, bTree, checking};
parseMode: ParsingMode Ź checking;

LinkHash: PROC[n: NodeIndex] = {
htIndex: HashIndex = HashValue[tree[n].state];
tree[n].link Ź hashTable[htIndex];
hashTable[htIndex] Ź n;
};

DelinkHash: PROC[n: NodeIndex] = {
htIndex: HashIndex = HashValue[tree[n].state];
p: NodeIndex Ź nullIndex;
FOR i: NodeIndex Ź hashTable[htIndex], tree[i].link UNTIL i = nullIndex DO
IF i = n THEN GO TO delete;
p Ź i;
REPEAT
delete =>
IF p = nullIndex THEN hashTable[htIndex] Ź tree[n].link
ELSE tree[p].link Ź tree[n].link;
ENDLOOP
};

ExistingConfiguration: PROC[stack: StackRep] RETURNS[NodeIndex] = {
htIndex: HashIndex;
aTree: BOOL;
SELECT parseMode FROM
$aTree => aTree Ź TRUE;
$bTree => aTree Ź FALSE;
ENDCASE => RETURN [nullIndex];
htIndex Ź HashValue[stack.extension];
FOR i: NodeIndex Ź hashTable[htIndex], tree[i].link UNTIL i = nullIndex DO
IF (IF aTree THEN tree[i].aLeaf ELSE tree[i].bLeaf) THEN {
s1: NPGSParseTable.State Ź stack.extension;
s2: NPGSParseTable.State Ź tree[i].state;
n1: NodeIndex Ź stack.leaf;
n2: NodeIndex Ź tree[i].father;
DO
IF s1 # s2 THEN EXIT;
IF n1 = n2 THEN RETURN [i];
s1 Ź tree[n1].state;  s2 Ź tree[n2].state;
n1 Ź tree[n1].father;  n2 Ź tree[n2].father;
ENDLOOP
};
ENDLOOP;
RETURN [nullIndex];
};

FindNode: PROC[parent, pred: NodeIndex, stateNo: NPGSParseTable.State] RETURNS[index: NodeIndex] = {
index Ź ExistingConfiguration[[leaf:parent, extension:stateNo]];
IF index = nullIndex THEN {
index Ź Allocate[parent, pred, 0, stateNo];
SELECT parseMode FROM
$aTree => {tree[index].aLeaf Ź TRUE; LinkHash[index]};
$bTree => {tree[index].bLeaf Ź TRUE; LinkHash[index]};
ENDCASE => NULL
};
};

TrimTree: PROC[newNext: NodeIndex] = {
WHILE nextNode > newNext DO
nextNode Ź nextNode-1; DelinkHash[nextNode] ENDLOOP
};


ExtState: TYPE = [NPGSParseTable.State.FIRST .. NPGSParseTable.State.LAST+1];
nullState: ExtState = ExtState.LAST;

StackRep: TYPE = RECORD[
leaf: NodeIndex,
extension: ExtState];

GetNTEntry: PROC[state: NPGSParseTable.State, lhs: NPGSParseTable.NTSymbol] RETURNS[NPGSParseTable.ActionEntry] = INLINE {
IF state <= NPGSParseTable.NTState.LAST THEN {
nI: NPGSParseTable.NTIndex Ź nStart[state];
FOR nI IN [nI..nI+nLength[state]) DO
IF lhs = nSymbol[nI] THEN RETURN[nAction[nI]] ENDLOOP
};
RETURN[ntDefaults[lhs]];
};

ActOnStack: PROC[stack: StackRep, action: NPGSParseTable.ActionEntry, nScanned: [0..1]]
RETURNS[StackRep] = {
currentNode, thread: NodeIndex Ź stack.leaf;
count: NAT Ź nScanned;
currentState: NPGSParseTable.State;
IF stack.extension = nullState THEN currentState Ź tree[currentNode].state
ELSE {currentState Ź stack.extension; count Ź count + 1};
UNTIL action.tag = scanTag DO
IF count > action.tag.pLength THEN {  -- can be one greater
currentNode Ź FindNode[currentNode, thread, currentState];
count Ź count - 1
};
UNTIL count = action.tag.pLength DO
currentNode Ź tree[currentNode].father; count Ź count + 1 ENDLOOP;
currentState Ź tree[currentNode].state;  count Ź 1;
action Ź GetNTEntry[currentState, prodData[action.transition].lhs];
ENDLOOP;
IF count > 1 THEN currentNode Ź FindNode[currentNode, thread, currentState];
stack.leaf Ź currentNode;  stack.extension Ź action.transition;
RETURN[stack];
};

ParseStep: PROC[stack: StackRep, input: NPGSParseTable.TSymbol] RETURNS[StackRep] = {
currentState: NPGSParseTable.State Ź (IF stack.extension = nullState
THEN tree[stack.leaf].state
ELSE stack.extension);
scanned: BOOL Ź FALSE;
UNTIL scanned OR currentState = NPGSParseTable.finalState DO
action: NPGSParseTable.ActionEntry;
count: [0..1];
tI: NPGSParseTable.TIndex Ź tStart[currentState];
FOR tI IN [tI..tI+tLength[currentState]) DO
SELECT tSymbol[tI] FROM  input, NPGSParseTable.defaultMarker => EXIT  ENDCASE;
REPEAT
FINISHED => RETURN[[nullIndex, nullState]];
ENDLOOP;
action Ź tAction[tI];
IF ~action.tag.reduce THEN {count Ź 1; scanned Ź TRUE}	-- shift or shift reduce
ELSE count Ź 0;
stack Ź ActOnStack[stack, action, count];
currentState Ź stack.extension;
ENDLOOP;
RETURN[stack];
};


Insert: TYPE = ARRAY [0 .. 1+insertLimit) OF NPGS1.Token;
newText: REF Insert;
insertCount: NAT Ź 0;

Buffer: TYPE = ARRAY [0 .. 1+discardLimit+(maxScanLimit+insertLimit)) OF NPGS1.Token;
scanBuffer: REF Buffer;
scanBase, scanLimit: NAT Ź 0;

Advance: PROC = {scanBuffer[scanLimit] Ź Input[]; scanLimit Ź scanLimit+1};

Discard: PROC = {
IF track THEN {
errorStream.PutRope["::discarding symbol: "];
TypeSym[scanBuffer[scanBase].class];
errorStream.PutChar['\n];
};
scanBase Ź scanBase+1;
};

UnDiscard: PROC = {
scanBase Ź scanBase-1;
IF track THEN {
errorStream.PutRope["::recovering symbol: "];
TypeSym[scanBuffer[scanBase].class];
errorStream.PutChar['\n];
};
};

RecoverInput: PROC RETURNS [token: NPGS1.Token] = {
IF insertCount <= insertLimit
THEN {
token Ź newText[insertCount];
IF (insertCount Ź insertCount+1) > insertLimit THEN FREE[@newText];
}
ELSE {
token Ź scanBuffer[scanBase];
IF (scanBase Ź scanBase+1) = scanLimit THEN {
FREE[@scanBuffer];
Input Ź NPGS1.NextToken;
};
};
};


best: RECORD [
nAccepted: NAT Ź 0,
nPassed: [0..1] Ź 0,
node: NodeIndex Ź 0,
mode: ParsingMode Ź checking,
nDiscards: NAT Ź 0];

RightScan: PROC[node: NodeIndex] RETURNS[stop: BOOL] = {
savedNextNode: NodeIndex = nextNode;
savedMode: ParsingMode = parseMode;
savedLimit: NAT = treeLimit;
stack: StackRep Ź [leaf:node, extension:nullState];
state: NPGSParseTable.State Ź tree[node].state;
nAccepted: NAT Ź 0;
parseMode Ź $checking;  treeLimit Ź treeSize;
FOR i: NAT IN [scanBase .. scanLimit) DO
IF state = NPGSParseTable.finalState THEN {
nAccepted Ź (IF (scanBuffer[i].class = NPGSParseTable.endMarker)
THEN scanLimit-scanBase
ELSE 0);
EXIT
};
stack Ź ParseStep[stack, scanBuffer[i].class];
IF stack.leaf = nullIndex THEN EXIT;
nAccepted Ź nAccepted + 1;  state Ź stack.extension;
ENDLOOP;
TrimTree[savedNextNode];  treeLimit Ź savedLimit;
SELECT (parseMode Ź savedMode) FROM
$aTree =>
IF nAccepted + 1 > best.nAccepted + best.nPassed THEN
best Ź [nAccepted, 1, node, $aTree, scanBase-1];
$bTree =>
IF nAccepted > best.nAccepted + best.nPassed THEN
best Ź [nAccepted, 0, node, $bTree, scanBase];
ENDCASE;
RETURN [nAccepted >= maxScanLimit];
};


RowRecord: TYPE = RECORD [
index, limit: NAT,
stack: StackRep,
next: RowHandle];

RowHandle: TYPE = REF RowRecord;

NextRow: PROC[list: RowHandle] RETURNS[row: RowHandle] = INLINE {
t: NPGSParseTable.TSymbol Ź NPGSParseTable.TSymbol.FIRST;
row Ź NIL;
FOR r: RowHandle Ź list, r.next UNTIL r = NIL DO
IF r.index < r.limit THEN {
s: NPGSParseTable.TSymbol = tSymbol[r.index];
IF row = NIL OR s < t THEN {row Ź r; t Ź s}
};
ENDLOOP;
};

FreeRowList: PROC[list: RowHandle] RETURNS[row: RowHandle] = {
r: RowHandle Ź NIL;
UNTIL  r = NIL DO
next: RowHandle = r.next;
FREE[@r];  r Ź r.next;
ENDLOOP;
RETURN [NIL];
};

Position: TYPE = {after, before};
Length: TYPE = NAT [0..insertLimit];

levelStart: ARRAY Position OF ARRAY Length OF NodeIndex Ź  [ALL[0], ALL[0]];
levelEnd: ARRAY Position OF ARRAY Length OF NodeIndex Ź  [ALL[0], ALL[0]];

AddLeaf: PROC[stack: StackRep, s: NPGSParseTable.TSymbol, thread: NodeIndex] RETURNS[stop: BOOL] = {
saveNextNode: NodeIndex = nextNode;
stack Ź ParseStep[stack, s];
IF stack.leaf = nullIndex OR ExistingConfiguration[stack] # nullIndex
THEN {
TrimTree[saveNextNode];
stop Ź FALSE;
} 
ELSE {
newLeaf: NodeIndex = Allocate[stack.leaf, thread, s, stack.extension];
SELECT parseMode FROM
$aTree => tree[newLeaf].aLeaf Ź TRUE;
$bTree => tree[newLeaf].bLeaf Ź TRUE;
ENDCASE => ERROR;
LinkHash[newLeaf];
IF track THEN DisplayNode[newLeaf];
stop Ź RightScan[newLeaf];
};
};


GrowTree: PROC[p: Position, n: Length] RETURNS[stop: BOOL] = {
rowList: RowHandle Ź NIL;
IF track THEN {
errorStream.Put[IO.rope["::generating length: "], IO.int[n]];
errorStream.PutChar[IF p = $before THEN 'B ELSE 'A];  errorStream.PutChar['\n]
};
FOR i: NodeIndex IN [levelStart[p][n-1] .. levelEnd[p][n-1]) DO
IF tree[i].symbol # 0 OR n = 1 THEN {
ENABLE UNWIND => {rowList Ź FreeRowList[rowList]};
stack: StackRep Ź [leaf:i, extension:nullState];
state: NPGSParseTable.State Ź tree[i].state;
r: RowHandle;
DO
tI: NPGSParseTable.TIndex = tStart[state];
tLimit: NAT = tI + tLength[state];
r Ź NEW[RowRecord];
r­ Ź RowRecord[index:tI, limit:tLimit, stack:stack, next:rowList];
rowList Ź r;
IF tI = tLimit OR tSymbol[tLimit-1] # NPGSParseTable.defaultMarker THEN EXIT;
r.limit Ź r.limit - 1;
stack Ź ActOnStack[stack, tAction[tLimit-1], 0];
state Ź stack.extension;
ENDLOOP;
UNTIL (r Ź NextRow[rowList]) = NIL DO
IF AddLeaf[r.stack, tSymbol[r.index], i] THEN GO TO found;
r.index Ź r.index + 1;
ENDLOOP;
rowList Ź FreeRowList[rowList]
};
REPEAT
found => stop Ź TRUE;
FINISHED => stop Ź FALSE;
ENDLOOP;
rowList Ź FreeRowList[rowList];
};

CheckTree: PROC[p: Position, n: Length] RETURNS[stop: BOOL] = {
IF track THEN {
errorStream.Put[IO.rope["::checking length: "], IO.int[n]];
errorStream.PutChar[IF p = $before THEN 'B ELSE 'A];  errorStream.PutChar['\n]
};
FOR i: NodeIndex IN [levelStart[p][n] .. levelEnd[p][n]) DO
{
ENABLE TreeFull => {CONTINUE};
IF RightScan[i] THEN GO TO found;
}
REPEAT
found => stop Ź TRUE;
FINISHED => stop Ź FALSE;
ENDLOOP;
};


Accept: PROC RETURNS[success: BOOL] = {
s: NPGSParseTable.TSymbol;
discardBase: NAT = best.nPassed;
insertCount Ź 1+insertLimit;
FOR p: NodeIndex Ź best.node, tree[p].last WHILE p > rTop DO
IF (s Ź tree[p].symbol) # 0 THEN {
insertCount Ź insertCount-1;
newText[insertCount] Ź NPGS1.Token[s, NPGS1.TokenValue[s], inputLoc]
};
ENDLOOP;
scanBase Ź discardBase;
IF best.nDiscards # 0 THEN {
errorStream.PutRope["Text deleted is: "];
FOR j: NAT IN [1 .. best.nDiscards] DO
TypeSym[scanBuffer[scanBase].class];  scanBase Ź scanBase + 1;
ENDLOOP
};
IF insertCount <= insertLimit THEN {
IF scanBase # discardBase THEN errorStream.PutChar['\n];
errorStream.PutRope["Text inserted is: "];
FOR j: NAT IN [insertCount .. insertLimit] DO
TypeSym[newText[j].class] ENDLOOP
};
IF discardBase = 1 THEN {insertCount Ź insertCount-1; newText[insertCount] Ź scanBuffer[0]};
IF insertCount > insertLimit THEN FREE[@newText];
IF scanBase + best.nAccepted < scanLimit THEN
success Ź NPGS1.ResetScanIndex[scanBuffer[scanBase+best.nAccepted].index]
ELSE success Ź TRUE;
scanLimit Ź scanBase + best.nAccepted;
Input Ź RecoverInput;
};

TypeSym: PROC [sym: NPGSParseTable.TSymbol] = {
errorStream.PutChar[' ];
IF sym IN [1..NPGSParseTable.endMarker)
THEN {
IF vocabIndex = NIL THEN vocabIndex Ź NPGSParseTable.InitIndexTable[];
IF vocabBody = NIL THEN vocabBody Ź NPGSParseTable.InitVocabulary[];
FOR i: NAT IN [vocabIndex[sym-1]..vocabIndex[sym]) DO
errorStream.PutChar[vocabBody[i]];
ENDLOOP;
}
ELSE errorStream.Put1[[integer[sym]]];
};


rTop: NodeIndex Ź 0;

Recover: PROC = {
ModeMap: ARRAY Position OF ParsingMode = [$aTree, $bTree];
stack: StackRep;

treeLimit Ź treeSize - checkSize;
hashTable­ Ź ALL[nullIndex];
rTop Ź nullIndex;  nextNode Ź maxNode Ź 1;

best.nAccepted Ź 0;  best.nPassed Ź 1;  best.mode Ź $aTree;
scanBuffer[0] Ź lastToken;
scanBuffer[1] Ź NPGS1.Token[inputSymbol, inputValue, inputLoc];
scanBase Ź 1;  scanLimit Ź 2;
THROUGH [1 .. maxScanLimit) DO Advance[] ENDLOOP;
FOR i: NAT IN [0 .. top) DO
rTop Ź Allocate[rTop, rTop, 0, s[i]];
IF track THEN DisplayNode[rTop];
ENDLOOP;
parseMode Ź $bTree;
levelStart[$before][0] Ź rTop Ź FindNode[rTop, rTop, s[top]];
tree[rTop].bLeaf Ź TRUE;
levelEnd[$before][0] Ź nextNode;
parseMode Ź $aTree;
stack Ź ParseStep[[leaf:rTop, extension:nullState], lastToken.class];
rTop Ź FindNode[stack.leaf, rTop, stack.extension];
tree[rTop].symbol Ź lastToken.class;
tree[rTop].aLeaf Ź tree[rTop].bLeaf Ź TRUE;
levelStart[$after][0] Ź rTop;  levelEnd[$after][0] Ź nextNode;
IF track THEN DisplayNode[rTop];

FOR level: Length IN [1 .. Length.LAST] DO
FOR place: Position IN Position DO
parseMode Ź ModeMap[place];
IF place = $before THEN UnDiscard[];
levelStart[place][level] Ź nextNode;
IF GrowTree[place, level ! TreeFull => {CONTINUE}] THEN GO TO found;
levelEnd[place][level] Ź nextNode;
THROUGH [1 .. level) DO
Discard[]; IF CheckTree[place, level] THEN GO TO found ENDLOOP;
Discard[];
IF place = $after THEN Advance[];
FOR inserts: NAT IN [0 .. level] DO
IF CheckTree[place, inserts] THEN GO TO found ENDLOOP;
THROUGH [1..level] DO UnDiscard[] ENDLOOP;
IF place = $before THEN Discard[];
ENDLOOP;
REPEAT
found => NULL;
FINISHED => {
threshold: NAT Ź (minScanLimit+maxScanLimit)/2;
THROUGH [1..Length.LAST] DO Discard[]; Advance[] ENDLOOP;
UNTIL scanBase > discardLimit DO
IF best.nAccepted >= threshold THEN GO TO found;
Discard[];
FOR inserts: NAT IN Length DO
FOR place: Position IN Position DO
parseMode Ź ModeMap[place];
IF place = $before THEN UnDiscard[];
IF CheckTree[place, inserts] THEN GO TO found;
IF place = $before THEN Discard[];
ENDLOOP;
ENDLOOP;
Advance[];
threshold Ź IF threshold > minScanLimit THEN threshold-1 ELSE minScanLimit;
REPEAT
found => NULL;
FINISHED =>
IF best.nAccepted < minScanLimit THEN {best.mode Ź $aTree; best.nPassed Ź 1};
ENDLOOP
};
ENDLOOP;
};

SyntaxError: PROC[
logger: PROC[PROC[IO.STREAM]], abort: BOOL] RETURNS [success: BOOL Ź FALSE] = {

Inner: PROC[log: IO.STREAM] = {
errorStream Ź log;
IF abort
THEN {
NPGS1.ErrorContext[errorStream, "syntax error", inputLoc];
errorStream.PutRope["... parse abandoned."];  errorStream.PutChar['\n];
success Ź FALSE;
}
ELSE {
scanBuffer Ź NEW[Buffer];
newText Ź NEW[Insert];
tree Ź NEW[TreeSpace];
hashTable Ź NEW[HashSpace];
Recover[ ! TreeFull => {CONTINUE}];
FREE[@hashTable];
NPGS1.ErrorContext[errorStream, "syntax error",
scanBuffer[IF best.mode=$bTree THEN 0 ELSE 1].index];
IF ~(success Ź best.nAccepted >= minScanLimit AND Accept[]) THEN {
errorStream.PutRope["No recovery found."];
FREE[@newText];
FREE[@scanBuffer];
};
FREE[@tree];
errorStream.PutChar['\n];
};
errorStream.PutChar['\n];
errorStream Ź NIL;
};

logger[Inner];
};

}.

   X  
NPGSParser.mesa - Cedar/Mesa parser with error recovery
Copyright Ó 1985, 1988, 1990, 1992 by Xerox Corporation.  All rights reserved.
Satterthwaite, May 27, 1986 9:53:25 am PDT
Paul Rovner, September 7, 1983 3:20 pm
Russ Atkinson (RRA) March 17, 1988 10:13:05 am PST
JKF May 24, 1990 10:58:18 am PDT

table installation
stuff for TypeSym
transition tables for terminal input symbols
transition tables for nonterminal input symbols
production information
parser state
initialization/termination
* * * *  Main Parsing Procedures * * * * --
* * * * Error Recovery Section * * * * --
parameters of error recovery
debugging
tree management
parsing simulation
text buffer management
acceptance checking
strategy management
stack node indices
try simple insertion (inserts=level)
try discards followed by 0 or more insertions
undo discards at this level
 Ęđ  "cedarcode" styleNewlineDelimiter
 77J
ĎeCNJ**J&&J22J  J codeĎk		KKöKÝńK Ďn
K!KKK JK JK K+/K*.K J,,K K"K$K$K$K J//K K"K$K$K$K)K JK K%K "K&K(K(K(K&K(K(K(K-K)KKKK JKK K%/K K$K K	)K
KK KK'K KKK
KK KKK K JK@K J++KK	#K
2K#KĎc)K#K 	KKKKKKKKK 
KKK+KKK KK  K KKKK2KK+KKK *+lK1$/K.RKKKK K AK
AK%*KK%=KBK0KK K(KKEK?(5K2 +K	?KKKKK
KKKK!9K(KK4KK@K8KK0KKKKK K"K*EK K KKK K !K	1K	K6K4K6
'K.KKKKK27KK 
K1KK !K	1K	K	:K
5K	K27KK K
.K J))JK KK KKKKK
K,K J		K KK #K$K	)K7K4K5K2KKKK JK K$KK KKKKKKK K3KK
 KK!KK KZhK!9K
KKKKK	KKKK K
 !6K K/KK 	FKKK K-K"K  K.K"KKK 
"K.K1JKKKK	"7K!KKK CKKKKKK%1J
:K+K)KKK	K	K*K,KKKKKK 9dK@K+K6K6KKKK &K,3KK JK K
7MK$K 
KKK 
<z!.K+$K5KKKK K
GWK,KK#'JK59 ;K:KK#K:BK3KCKK;LK?KKK 	1U&DKKK		*<K#KK1 +K)NKK+KKK OKK)KKKKK JK K	9K	KK K	2UKKK K>KK K-K$KKKKK 	KK-K$KKKK 	3KKK-CKK%-KKKKKK K JK KKKKKK 	8K$K#KK3K/KK-(#+1@KKKKK.K$K4KK1#K	K/5K0K	K+1K.KK#KK K JK KKKK K K AK39K
0K-K+KKKK >KKKKKKK K
!K$K K
LK

JK @dK#KK)EKKKKFK %K %KKK#KKKK K >KK 	=KNK*?%K%2K0K,KK*K"KKBKK2MKK0KK%K':KKKKKKKKKKK 	?K	;KNK&;KK!KKKKKKK K 
'KK K(
<"KK
DKKKK)&K>KK$K8K*-K!KKE\K1K'-
:IKK&KKK "/KK'K.FK-D&5K"KKK"&KK JK KK K
 :KK K!KK*K K;KK*?KK1K%K KKK=KK KKEK3K$K&+K>K K *
"KK$J$$K$K
&DK"J--K?K
K!
#K
6JK*K"KKK	K!/K9 K0K


"KK$K.K"KKK
KKKK	KK(MKKKKK K
OK KKK5:KGK
KK	K
	KKK#K*/K5,BK*KKKKKKKKKK KKK KK      Sb  pŞ  