@sccharts-lab/engine 0.0.0-stage → 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +277 -0
- package/README.md +125 -2
- package/dist/codegen/expr.d.ts +36 -0
- package/dist/codegen/expr.js +252 -0
- package/dist/codegen/expr.js.map +1 -0
- package/dist/codegen/index.d.ts +4 -0
- package/dist/codegen/index.js +238 -0
- package/dist/codegen/index.js.map +1 -0
- package/dist/codegen/layout.d.ts +57 -0
- package/dist/codegen/layout.js +306 -0
- package/dist/codegen/layout.js.map +1 -0
- package/dist/codegen/logic.d.ts +31 -0
- package/dist/codegen/logic.js +258 -0
- package/dist/codegen/logic.js.map +1 -0
- package/dist/codegen/methods.d.ts +17 -0
- package/dist/codegen/methods.js +242 -0
- package/dist/codegen/methods.js.map +1 -0
- package/dist/codegen/reset.d.ts +6 -0
- package/dist/codegen/reset.js +110 -0
- package/dist/codegen/reset.js.map +1 -0
- package/dist/codegen/types.d.ts +81 -0
- package/dist/codegen/types.js +3 -0
- package/dist/codegen/types.js.map +1 -0
- package/dist/format.d.ts +136 -0
- package/dist/format.js +872 -0
- package/dist/format.js.map +1 -0
- package/dist/index.d.ts +120 -0
- package/dist/index.js +507 -0
- package/dist/index.js.map +1 -0
- package/dist/internal.d.ts +1 -0
- package/dist/internal.js +4 -0
- package/dist/internal.js.map +1 -0
- package/dist/parser/ids.d.ts +4 -0
- package/dist/parser/ids.js +172 -0
- package/dist/parser/ids.js.map +1 -0
- package/dist/parser/imports.d.ts +2 -0
- package/dist/parser/imports.js +28 -0
- package/dist/parser/imports.js.map +1 -0
- package/dist/parser/interface.d.ts +10 -0
- package/dist/parser/interface.js +93 -0
- package/dist/parser/interface.js.map +1 -0
- package/dist/parser/kielerWording.d.ts +2 -0
- package/dist/parser/kielerWording.js +196 -0
- package/dist/parser/kielerWording.js.map +1 -0
- package/dist/parser/lexer.d.ts +25 -0
- package/dist/parser/lexer.js +334 -0
- package/dist/parser/lexer.js.map +1 -0
- package/dist/parser/parser.d.ts +29 -0
- package/dist/parser/parser.js +3249 -0
- package/dist/parser/parser.js.map +1 -0
- package/dist/parser/resolve.d.ts +46 -0
- package/dist/parser/resolve.js +919 -0
- package/dist/parser/resolve.js.map +1 -0
- package/dist/parser/source.d.ts +15 -0
- package/dist/parser/source.js +42 -0
- package/dist/parser/source.js.map +1 -0
- package/dist/parser/validate.d.ts +5 -0
- package/dist/parser/validate.js +1430 -0
- package/dist/parser/validate.js.map +1 -0
- package/dist/sim/abortRegions.d.ts +9 -0
- package/dist/sim/abortRegions.js +192 -0
- package/dist/sim/abortRegions.js.map +1 -0
- package/dist/sim/analysis.d.ts +113 -0
- package/dist/sim/analysis.js +1104 -0
- package/dist/sim/analysis.js.map +1 -0
- package/dist/sim/codegen.d.ts +30 -0
- package/dist/sim/codegen.js +730 -0
- package/dist/sim/codegen.js.map +1 -0
- package/dist/sim/compile.d.ts +43 -0
- package/dist/sim/compile.js +1062 -0
- package/dist/sim/compile.js.map +1 -0
- package/dist/sim/deps.d.ts +73 -0
- package/dist/sim/deps.js +481 -0
- package/dist/sim/deps.js.map +1 -0
- package/dist/sim/describe.d.ts +22 -0
- package/dist/sim/describe.js +272 -0
- package/dist/sim/describe.js.map +1 -0
- package/dist/sim/describePreemption.d.ts +22 -0
- package/dist/sim/describePreemption.js +90 -0
- package/dist/sim/describePreemption.js.map +1 -0
- package/dist/sim/describeStructure.d.ts +75 -0
- package/dist/sim/describeStructure.js +293 -0
- package/dist/sim/describeStructure.js.map +1 -0
- package/dist/sim/eval.d.ts +99 -0
- package/dist/sim/eval.js +644 -0
- package/dist/sim/eval.js.map +1 -0
- package/dist/sim/exec.d.ts +212 -0
- package/dist/sim/exec.js +874 -0
- package/dist/sim/exec.js.map +1 -0
- package/dist/sim/fold.d.ts +2 -0
- package/dist/sim/fold.js +40 -0
- package/dist/sim/fold.js.map +1 -0
- package/dist/sim/goblock.d.ts +16 -0
- package/dist/sim/goblock.js +171 -0
- package/dist/sim/goblock.js.map +1 -0
- package/dist/sim/guardIndices.d.ts +13 -0
- package/dist/sim/guardIndices.js +137 -0
- package/dist/sim/guardIndices.js.map +1 -0
- package/dist/sim/index.d.ts +43 -0
- package/dist/sim/index.js +138 -0
- package/dist/sim/index.js.map +1 -0
- package/dist/sim/lower.d.ts +33 -0
- package/dist/sim/lower.js +716 -0
- package/dist/sim/lower.js.map +1 -0
- package/dist/sim/memory.d.ts +47 -0
- package/dist/sim/memory.js +328 -0
- package/dist/sim/memory.js.map +1 -0
- package/dist/sim/model.d.ts +487 -0
- package/dist/sim/model.js +772 -0
- package/dist/sim/model.js.map +1 -0
- package/dist/sim/passes/abort.d.ts +2 -0
- package/dist/sim/passes/abort.js +269 -0
- package/dist/sim/passes/abort.js.map +1 -0
- package/dist/sim/passes/abortRegion.d.ts +10 -0
- package/dist/sim/passes/abortRegion.js +62 -0
- package/dist/sim/passes/abortRegion.js.map +1 -0
- package/dist/sim/passes/arrayAssignment.d.ts +2 -0
- package/dist/sim/passes/arrayAssignment.js +147 -0
- package/dist/sim/passes/arrayAssignment.js.map +1 -0
- package/dist/sim/passes/codeEffects.d.ts +2 -0
- package/dist/sim/passes/codeEffects.js +14 -0
- package/dist/sim/passes/codeEffects.js.map +1 -0
- package/dist/sim/passes/complexFinalState.d.ts +4 -0
- package/dist/sim/passes/complexFinalState.js +77 -0
- package/dist/sim/passes/complexFinalState.js.map +1 -0
- package/dist/sim/passes/connector.d.ts +2 -0
- package/dist/sim/passes/connector.js +18 -0
- package/dist/sim/passes/connector.js.map +1 -0
- package/dist/sim/passes/contained.d.ts +37 -0
- package/dist/sim/passes/contained.js +198 -0
- package/dist/sim/passes/contained.js.map +1 -0
- package/dist/sim/passes/context.d.ts +39 -0
- package/dist/sim/passes/context.js +3 -0
- package/dist/sim/passes/context.js.map +1 -0
- package/dist/sim/passes/countDelay.d.ts +2 -0
- package/dist/sim/passes/countDelay.js +51 -0
- package/dist/sim/passes/countDelay.js.map +1 -0
- package/dist/sim/passes/dataflow.d.ts +11 -0
- package/dist/sim/passes/dataflow.js +319 -0
- package/dist/sim/passes/dataflow.js.map +1 -0
- package/dist/sim/passes/deferred.d.ts +2 -0
- package/dist/sim/passes/deferred.js +345 -0
- package/dist/sim/passes/deferred.js.map +1 -0
- package/dist/sim/passes/detect.d.ts +10 -0
- package/dist/sim/passes/detect.js +33 -0
- package/dist/sim/passes/detect.js.map +1 -0
- package/dist/sim/passes/during.d.ts +2 -0
- package/dist/sim/passes/during.js +67 -0
- package/dist/sim/passes/during.js.map +1 -0
- package/dist/sim/passes/entry.d.ts +5 -0
- package/dist/sim/passes/entry.js +93 -0
- package/dist/sim/passes/entry.js.map +1 -0
- package/dist/sim/passes/enum.d.ts +2 -0
- package/dist/sim/passes/enum.js +22 -0
- package/dist/sim/passes/enum.js.map +1 -0
- package/dist/sim/passes/exit.d.ts +4 -0
- package/dist/sim/passes/exit.js +120 -0
- package/dist/sim/passes/exit.js.map +1 -0
- package/dist/sim/passes/finalRegion.d.ts +2 -0
- package/dist/sim/passes/finalRegion.js +21 -0
- package/dist/sim/passes/finalRegion.js.map +1 -0
- package/dist/sim/passes/followedBy.d.ts +2 -0
- package/dist/sim/passes/followedBy.js +78 -0
- package/dist/sim/passes/followedBy.js.map +1 -0
- package/dist/sim/passes/forRegion.d.ts +9 -0
- package/dist/sim/passes/forRegion.js +230 -0
- package/dist/sim/passes/forRegion.js.map +1 -0
- package/dist/sim/passes/history.d.ts +12 -0
- package/dist/sim/passes/history.js +115 -0
- package/dist/sim/passes/history.js.map +1 -0
- package/dist/sim/passes/hostCode.d.ts +2 -0
- package/dist/sim/passes/hostCode.js +152 -0
- package/dist/sim/passes/hostCode.js.map +1 -0
- package/dist/sim/passes/index.d.ts +4 -0
- package/dist/sim/passes/index.js +84 -0
- package/dist/sim/passes/index.js.map +1 -0
- package/dist/sim/passes/inheritance.d.ts +8 -0
- package/dist/sim/passes/inheritance.js +233 -0
- package/dist/sim/passes/inheritance.js.map +1 -0
- package/dist/sim/passes/initOperator.d.ts +2 -0
- package/dist/sim/passes/initOperator.js +68 -0
- package/dist/sim/passes/initOperator.js.map +1 -0
- package/dist/sim/passes/initialization.d.ts +2 -0
- package/dist/sim/passes/initialization.js +69 -0
- package/dist/sim/passes/initialization.js.map +1 -0
- package/dist/sim/passes/ode.d.ts +2 -0
- package/dist/sim/passes/ode.js +14 -0
- package/dist/sim/passes/ode.js.map +1 -0
- package/dist/sim/passes/period.d.ts +2 -0
- package/dist/sim/passes/period.js +106 -0
- package/dist/sim/passes/period.js.map +1 -0
- package/dist/sim/passes/prTransitions.d.ts +2 -0
- package/dist/sim/passes/prTransitions.js +12 -0
- package/dist/sim/passes/prTransitions.js.map +1 -0
- package/dist/sim/passes/pre.d.ts +4 -0
- package/dist/sim/passes/pre.js +326 -0
- package/dist/sim/passes/pre.js.map +1 -0
- package/dist/sim/passes/quirks.d.ts +2 -0
- package/dist/sim/passes/quirks.js +169 -0
- package/dist/sim/passes/quirks.js.map +1 -0
- package/dist/sim/passes/reference.d.ts +60 -0
- package/dist/sim/passes/reference.js +386 -0
- package/dist/sim/passes/reference.js.map +1 -0
- package/dist/sim/passes/regionActions.d.ts +2 -0
- package/dist/sim/passes/regionActions.js +56 -0
- package/dist/sim/passes/regionActions.js.map +1 -0
- package/dist/sim/passes/sequentialFollowedBy.d.ts +2 -0
- package/dist/sim/passes/sequentialFollowedBy.js +72 -0
- package/dist/sim/passes/sequentialFollowedBy.js.map +1 -0
- package/dist/sim/passes/signal.d.ts +2 -0
- package/dist/sim/passes/signal.js +230 -0
- package/dist/sim/passes/signal.js.map +1 -0
- package/dist/sim/passes/static.d.ts +5 -0
- package/dist/sim/passes/static.js +67 -0
- package/dist/sim/passes/static.js.map +1 -0
- package/dist/sim/passes/suspend.d.ts +10 -0
- package/dist/sim/passes/suspend.js +71 -0
- package/dist/sim/passes/suspend.js.map +1 -0
- package/dist/sim/passes/termination.d.ts +9 -0
- package/dist/sim/passes/termination.js +69 -0
- package/dist/sim/passes/termination.js.map +1 -0
- package/dist/sim/passes/timedAutomata.d.ts +10 -0
- package/dist/sim/passes/timedAutomata.js +437 -0
- package/dist/sim/passes/timedAutomata.js.map +1 -0
- package/dist/sim/passes/unpackClasses.d.ts +2 -0
- package/dist/sim/passes/unpackClasses.js +54 -0
- package/dist/sim/passes/unpackClasses.js.map +1 -0
- package/dist/sim/passes/userSchedule.d.ts +2 -0
- package/dist/sim/passes/userSchedule.js +43 -0
- package/dist/sim/passes/userSchedule.js.map +1 -0
- package/dist/sim/passes/weakSuspend.d.ts +2 -0
- package/dist/sim/passes/weakSuspend.js +145 -0
- package/dist/sim/passes/weakSuspend.js.map +1 -0
- package/dist/sim/preemptionLog.d.ts +41 -0
- package/dist/sim/preemptionLog.js +133 -0
- package/dist/sim/preemptionLog.js.map +1 -0
- package/dist/sim/random.d.ts +12 -0
- package/dist/sim/random.js +40 -0
- package/dist/sim/random.js.map +1 -0
- package/dist/sim/reasons.d.ts +29 -0
- package/dist/sim/reasons.js +168 -0
- package/dist/sim/reasons.js.map +1 -0
- package/dist/sim/scg.d.ts +124 -0
- package/dist/sim/scg.js +723 -0
- package/dist/sim/scg.js.map +1 -0
- package/dist/sim/sfr.d.ts +4 -0
- package/dist/sim/sfr.js +264 -0
- package/dist/sim/sfr.js.map +1 -0
- package/dist/sim/stringConditions.d.ts +3 -0
- package/dist/sim/stringConditions.js +42 -0
- package/dist/sim/stringConditions.js.map +1 -0
- package/dist/sim/structure/copy.d.ts +4 -0
- package/dist/sim/structure/copy.js +140 -0
- package/dist/sim/structure/copy.js.map +1 -0
- package/dist/sim/structure/delays.d.ts +30 -0
- package/dist/sim/structure/delays.js +127 -0
- package/dist/sim/structure/delays.js.map +1 -0
- package/dist/sim/structure/instance.d.ts +15 -0
- package/dist/sim/structure/instance.js +69 -0
- package/dist/sim/structure/instance.js.map +1 -0
- package/dist/sim/structure/methods.d.ts +19 -0
- package/dist/sim/structure/methods.js +550 -0
- package/dist/sim/structure/methods.js.map +1 -0
- package/dist/sim/structure/rewrite.d.ts +20 -0
- package/dist/sim/structure/rewrite.js +113 -0
- package/dist/sim/structure/rewrite.js.map +1 -0
- package/dist/sim/structure/track.d.ts +22 -0
- package/dist/sim/structure/track.js +123 -0
- package/dist/sim/structure/track.js.map +1 -0
- package/dist/sim/tracker.d.ts +77 -0
- package/dist/sim/tracker.js +265 -0
- package/dist/sim/tracker.js.map +1 -0
- package/dist/sim/values.d.ts +31 -0
- package/dist/sim/values.js +103 -0
- package/dist/sim/values.js.map +1 -0
- package/dist/types.d.ts +670 -0
- package/dist/types.js +9 -0
- package/dist/types.js.map +1 -0
- package/package.json +58 -3
|
@@ -0,0 +1,172 @@
|
|
|
1
|
+
// Element ids, exactly as specified in ../types.ts:
|
|
2
|
+
//
|
|
3
|
+
// root state <ChartName> region <parentStateId>:<regionName | index>
|
|
4
|
+
// state <parentStateId>.<stateName> (<regionId>.<stateName> when two regions of the parent hold a
|
|
5
|
+
// state of that name)
|
|
6
|
+
// transition <sourceStateId>-><priority> action <stateId>!<kind><index among that kind>
|
|
7
|
+
// declaration <scopeId>$<valuedObjectName>
|
|
8
|
+
//
|
|
9
|
+
// Collisions the convention does not cover get a suffix: a second region with the same name uses its index, a
|
|
10
|
+
// second state or valued object with the same name in the same scope gets #2, #3, ... The implicit state that
|
|
11
|
+
// holds the inner regions of `region R { region A: ... }` is <regionId>._ . Members of a class, struct or enum are
|
|
12
|
+
// <scopeId>$<Type>.<member>; declarations inside methods and code blocks are <ownerId>$<name> where the owner is
|
|
13
|
+
// the method's id or <transitionOrActionId>~<n> for the n-th code block.
|
|
14
|
+
export function assignIds(program) {
|
|
15
|
+
const charts = new Map();
|
|
16
|
+
for (const chart of program.charts) {
|
|
17
|
+
const n = (charts.get(chart.name) ?? 0) + 1;
|
|
18
|
+
charts.set(chart.name, n);
|
|
19
|
+
assignState(chart, n === 1 ? chart.name : `${chart.name}#${n}`);
|
|
20
|
+
}
|
|
21
|
+
}
|
|
22
|
+
function unique(base, used) {
|
|
23
|
+
const n = (used.get(base) ?? 0) + 1;
|
|
24
|
+
used.set(base, n);
|
|
25
|
+
return n === 1 ? base : `${base}#${n}`;
|
|
26
|
+
}
|
|
27
|
+
function assignDeclarations(declarations, scopeId, used) {
|
|
28
|
+
for (const d of declarations) {
|
|
29
|
+
for (const vo of d.valuedObjects)
|
|
30
|
+
vo.id = unique(`${scopeId}$${vo.name}`, used);
|
|
31
|
+
if (d.members) {
|
|
32
|
+
const typeName = d.className ?? d.valuedObjects[0]?.name ?? '?';
|
|
33
|
+
const memberScope = `${scopeId}$${typeName}`;
|
|
34
|
+
const memberUsed = new Map();
|
|
35
|
+
for (const m of d.members) {
|
|
36
|
+
for (const vo of m.valuedObjects)
|
|
37
|
+
vo.id = unique(`${memberScope}.${vo.name}`, memberUsed);
|
|
38
|
+
if (m.declKind === 'method')
|
|
39
|
+
assignMethod(m);
|
|
40
|
+
if (m.members)
|
|
41
|
+
assignDeclarations(m.members, `${memberScope}.${m.className ?? m.valuedObjects[0]?.name ?? '?'}`, new Map());
|
|
42
|
+
}
|
|
43
|
+
}
|
|
44
|
+
if (d.declKind === 'method')
|
|
45
|
+
assignMethod(d);
|
|
46
|
+
for (const p of d.policies ?? [])
|
|
47
|
+
assignPolicy(p, `${scopeId}$${d.className ?? '?'}:policy.${p.name ?? ''}`);
|
|
48
|
+
}
|
|
49
|
+
}
|
|
50
|
+
/** Policy regions: <ownerId>:policy.<name>, their states <regionId>.<state>. */
|
|
51
|
+
function assignPolicy(region, regionId) {
|
|
52
|
+
region.id = regionId;
|
|
53
|
+
assignDeclarations(region.declarations, regionId, new Map());
|
|
54
|
+
const used = new Map();
|
|
55
|
+
for (const s of region.states) {
|
|
56
|
+
s.id = unique(`${regionId}.${s.name}`, used);
|
|
57
|
+
s.transitions.forEach((t, i) => {
|
|
58
|
+
t.priority = i + 1;
|
|
59
|
+
t.source = s.id;
|
|
60
|
+
t.id = `${s.id}->${t.priority}`;
|
|
61
|
+
});
|
|
62
|
+
}
|
|
63
|
+
}
|
|
64
|
+
function assignMethod(d) {
|
|
65
|
+
const methodId = d.valuedObjects[0]?.id ?? '?';
|
|
66
|
+
const used = new Map();
|
|
67
|
+
if (d.parameters)
|
|
68
|
+
assignDeclarations(d.parameters, methodId, used);
|
|
69
|
+
if (d.body) {
|
|
70
|
+
assignDeclarations(d.body.declarations, methodId, used);
|
|
71
|
+
assignStatements(d.body.statements, methodId, used, { n: 0 });
|
|
72
|
+
}
|
|
73
|
+
}
|
|
74
|
+
function assignStatements(statements, ownerId, used, counter) {
|
|
75
|
+
for (const s of statements) {
|
|
76
|
+
if (s.kind === 'block' || s.kind === 'while') {
|
|
77
|
+
assignDeclarations(s.declarations, ownerId, used);
|
|
78
|
+
assignStatements(s.statements, ownerId, used, counter);
|
|
79
|
+
}
|
|
80
|
+
else if (s.kind === 'if') {
|
|
81
|
+
assignDeclarations(s.declarations, ownerId, used);
|
|
82
|
+
assignStatements(s.statements, ownerId, used, counter);
|
|
83
|
+
if (s.else) {
|
|
84
|
+
assignDeclarations(s.else.declarations, ownerId, used);
|
|
85
|
+
assignStatements(s.else.statements, ownerId, used, counter);
|
|
86
|
+
}
|
|
87
|
+
}
|
|
88
|
+
else if (s.kind === 'for') {
|
|
89
|
+
if (s.init && s.init.kind === 'declaration')
|
|
90
|
+
assignDeclarations([s.init], ownerId, used);
|
|
91
|
+
assignDeclarations(s.declarations, ownerId, used);
|
|
92
|
+
assignStatements(s.statements, ownerId, used, counter);
|
|
93
|
+
}
|
|
94
|
+
}
|
|
95
|
+
}
|
|
96
|
+
function assignEffects(effects, ownerId) {
|
|
97
|
+
let n = 0;
|
|
98
|
+
for (const e of effects) {
|
|
99
|
+
if (e.kind !== 'code')
|
|
100
|
+
continue;
|
|
101
|
+
const blockId = `${ownerId}~${n++}`;
|
|
102
|
+
const used = new Map();
|
|
103
|
+
if (e.declarations)
|
|
104
|
+
assignDeclarations(e.declarations, blockId, used);
|
|
105
|
+
if (e.statements)
|
|
106
|
+
assignStatements(e.statements, blockId, used, { n: 0 });
|
|
107
|
+
}
|
|
108
|
+
}
|
|
109
|
+
function assignActions(actions, ownerId) {
|
|
110
|
+
const counts = new Map();
|
|
111
|
+
for (const a of actions) {
|
|
112
|
+
const n = counts.get(a.kind) ?? 0;
|
|
113
|
+
counts.set(a.kind, n + 1);
|
|
114
|
+
a.id = `${ownerId}!${a.kind}${n}`;
|
|
115
|
+
assignEffects(a.effects, a.id);
|
|
116
|
+
}
|
|
117
|
+
}
|
|
118
|
+
function assignState(state, id) {
|
|
119
|
+
state.id = id;
|
|
120
|
+
const declUsed = new Map();
|
|
121
|
+
assignDeclarations(state.declarations, id, declUsed);
|
|
122
|
+
assignActions(state.actions, id);
|
|
123
|
+
// Region ids: the name, or the index (also for a repeated name).
|
|
124
|
+
const regionNames = new Set();
|
|
125
|
+
const regionIds = state.regions.map((r, i) => {
|
|
126
|
+
if (r.name !== undefined && r.name !== '' && !regionNames.has(r.name)) {
|
|
127
|
+
regionNames.add(r.name);
|
|
128
|
+
return `${id}:${r.name}`;
|
|
129
|
+
}
|
|
130
|
+
return `${id}:${i}`;
|
|
131
|
+
});
|
|
132
|
+
// A state name that occurs in more than one region of this parent is qualified by its region.
|
|
133
|
+
const regionsOfName = new Map();
|
|
134
|
+
state.regions.forEach((r, i) => {
|
|
135
|
+
for (const s of r.states) {
|
|
136
|
+
const set = regionsOfName.get(s.name) ?? new Set();
|
|
137
|
+
set.add(i);
|
|
138
|
+
regionsOfName.set(s.name, set);
|
|
139
|
+
}
|
|
140
|
+
});
|
|
141
|
+
state.regions.forEach((r, i) => assignRegion(r, regionIds[i], id, regionsOfName));
|
|
142
|
+
state.transitions.forEach((t, i) => {
|
|
143
|
+
t.priority = i + 1;
|
|
144
|
+
t.source = id;
|
|
145
|
+
t.id = `${id}->${t.priority}`;
|
|
146
|
+
assignEffects(t.effects, t.id);
|
|
147
|
+
});
|
|
148
|
+
for (const p of state.policies ?? [])
|
|
149
|
+
assignPolicy(p, `${id}:policy.${p.name ?? ''}`);
|
|
150
|
+
}
|
|
151
|
+
function assignRegion(region, regionId, parentId, regionsOfName) {
|
|
152
|
+
region.id = regionId;
|
|
153
|
+
const used = new Map();
|
|
154
|
+
if (region.forLoop)
|
|
155
|
+
used.set(`${regionId}$${region.forLoop.variable}`, 1);
|
|
156
|
+
assignDeclarations(region.declarations, regionId, used);
|
|
157
|
+
assignActions(region.actions, regionId);
|
|
158
|
+
const stateUsed = new Map();
|
|
159
|
+
for (const s of region.states) {
|
|
160
|
+
if (s.name === '') {
|
|
161
|
+
assignState(s, unique(`${regionId}._`, stateUsed));
|
|
162
|
+
continue;
|
|
163
|
+
}
|
|
164
|
+
const base = (regionsOfName.get(s.name)?.size ?? 0) > 1 ? `${regionId}.${s.name}` : `${parentId}.${s.name}`;
|
|
165
|
+
assignState(s, unique(base, stateUsed));
|
|
166
|
+
}
|
|
167
|
+
}
|
|
168
|
+
/** Id of a region's for-loop counter variable. */
|
|
169
|
+
export function counterId(region) {
|
|
170
|
+
return `${region.id}$${region.forLoop?.variable ?? ''}`;
|
|
171
|
+
}
|
|
172
|
+
//# sourceMappingURL=ids.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"ids.js","sourceRoot":"","sources":["../../src/parser/ids.ts"],"names":[],"mappings":"AAAA,oDAAoD;AACpD,EAAE;AACF,kGAAkG;AAClG,+GAA+G;AAC/G,qEAAqE;AACrE,qGAAqG;AACrG,6CAA6C;AAC7C,EAAE;AACF,8GAA8G;AAC9G,8GAA8G;AAC9G,mHAAmH;AACnH,iHAAiH;AACjH,yEAAyE;AAIzE,MAAM,UAAU,SAAS,CAAC,OAAgB;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;QAC3C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QACzB,WAAW,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAA;IACnE,CAAC;AACL,CAAC;AAED,SAAS,MAAM,CAAC,IAAY,EAAE,IAAyB;IACnD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;IACnC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACjB,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAA;AAC1C,CAAC;AAED,SAAS,kBAAkB,CAAC,YAA2B,EAAE,OAAe,EAAE,IAAyB;IAC/F,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;QAC3B,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,aAAa;YAAE,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,OAAO,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAA;QAC/E,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YACZ,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG,CAAA;YAC/D,MAAM,WAAW,GAAG,GAAG,OAAO,IAAI,QAAQ,EAAE,CAAA;YAC5C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;YAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;gBACxB,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,aAAa;oBAAE,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,WAAW,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,UAAU,CAAC,CAAA;gBACzF,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ;oBAAE,YAAY,CAAC,CAAC,CAAC,CAAA;gBAC5C,IAAI,CAAC,CAAC,OAAO;oBAAE,kBAAkB,CAAC,CAAC,CAAC,OAAO,EAAE,GAAG,WAAW,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;YAC/H,CAAC;QACL,CAAC;QACD,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ;YAAE,YAAY,CAAC,CAAC,CAAC,CAAA;QAC5C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,IAAI,EAAE;YAAE,YAAY,CAAC,CAAC,EAAE,GAAG,OAAO,IAAI,CAAC,CAAC,SAAS,IAAI,GAAG,WAAW,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CAAA;IAChH,CAAC;AACL,CAAC;AAED,gFAAgF;AAChF,SAAS,YAAY,CAAC,MAAc,EAAE,QAAgB;IAClD,MAAM,CAAC,EAAE,GAAG,QAAQ,CAAA;IACpB,kBAAkB,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;IAC5D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,CAAA;QAC5C,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC3B,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;YAClB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAA;YACf,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAA;QACnC,CAAC,CAAC,CAAA;IACN,CAAC;AACL,CAAC;AAED,SAAS,YAAY,CAAC,CAAc;IAChC,MAAM,QAAQ,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAA;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,IAAI,CAAC,CAAC,UAAU;QAAE,kBAAkB,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;IAClE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACT,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;QACvD,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;IACjE,CAAC;AACL,CAAC;AAED,SAAS,gBAAgB,CAAC,UAA0B,EAAE,OAAe,EAAE,IAAyB,EAAE,OAAsB;IACpH,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QACzB,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC3C,kBAAkB,CAAC,CAAC,CAAC,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;YACjD,gBAAgB,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC1D,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACzB,kBAAkB,CAAC,CAAC,CAAC,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;YACjD,gBAAgB,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YACtD,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACT,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;gBACtD,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;YAC/D,CAAC;QACL,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,aAAa;gBAAE,kBAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;YACxF,kBAAkB,CAAC,CAAC,CAAC,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;YACjD,gBAAgB,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC1D,CAAC;IACL,CAAC;AACL,CAAC;AAED,SAAS,aAAa,CAAC,OAAiB,EAAE,OAAe;IACrD,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,SAAQ;QAC/B,MAAM,OAAO,GAAG,GAAG,OAAO,IAAI,CAAC,EAAE,EAAE,CAAA;QACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;QACtC,IAAI,CAAC,CAAC,YAAY;YAAE,kBAAkB,CAAC,CAAC,CAAC,YAAY,EAAE,OAAO,EAAE,IAAI,CAAC,CAAA;QACrE,IAAI,CAAC,CAAC,UAAU;YAAE,gBAAgB,CAAC,CAAC,CAAC,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;IAC7E,CAAC;AACL,CAAC;AAED,SAAS,aAAa,CAAC,OAAsB,EAAE,OAAe;IAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACzB,CAAC,CAAC,EAAE,GAAG,GAAG,OAAO,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,EAAE,CAAA;QACjC,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;IAClC,CAAC;AACL,CAAC;AAED,SAAS,WAAW,CAAC,KAAY,EAAE,EAAU;IACzC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAA;IACb,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC1C,kBAAkB,CAAC,KAAK,CAAC,YAAY,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAA;IACpD,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAA;IAEhC,iEAAiE;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IACrC,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzC,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACpE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACvB,OAAO,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;QAC5B,CAAC;QACD,OAAO,GAAG,EAAE,IAAI,CAAC,EAAE,CAAA;IACvB,CAAC,CAAC,CAAA;IACF,8FAA8F;IAC9F,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAA;IACpD,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAA;YAC1D,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACV,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QAClC,CAAC;IACL,CAAC,CAAC,CAAA;IACF,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC,CAAA;IAEjF,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/B,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;QAClB,CAAC,CAAC,MAAM,GAAG,EAAE,CAAA;QACb,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAA;QAC7B,aAAa,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;IAClC,CAAC,CAAC,CAAA;IACF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE;QAAE,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,CAAA;AACzF,CAAC;AAED,SAAS,YAAY,CAAC,MAAc,EAAE,QAAgB,EAAE,QAAgB,EAAE,aAAuC;IAC7G,MAAM,CAAC,EAAE,GAAG,QAAQ,CAAA;IACpB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,IAAI,MAAM,CAAC,OAAO;QAAE,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAA;IACzE,kBAAkB,CAAC,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;IACvD,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;IACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC3C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,EAAE,EAAE,CAAC;YAChB,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,QAAQ,IAAI,EAAE,SAAS,CAAC,CAAC,CAAA;YAClD,SAAQ;QACZ,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,CAAC,CAAC,IAAI,EAAE,CAAA;QAC3G,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAA;IAC3C,CAAC;AACL,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,SAAS,CAAC,MAAc;IACpC,OAAO,GAAG,MAAM,CAAC,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,CAAA;AAC3D,CAAC","sourcesContent":["// Element ids, exactly as specified in ../types.ts:\n//\n// root state <ChartName> region <parentStateId>:<regionName | index>\n// state <parentStateId>.<stateName> (<regionId>.<stateName> when two regions of the parent hold a\n// state of that name)\n// transition <sourceStateId>-><priority> action <stateId>!<kind><index among that kind>\n// declaration <scopeId>$<valuedObjectName>\n//\n// Collisions the convention does not cover get a suffix: a second region with the same name uses its index, a\n// second state or valued object with the same name in the same scope gets #2, #3, ... The implicit state that\n// holds the inner regions of `region R { region A: ... }` is <regionId>._ . Members of a class, struct or enum are\n// <scopeId>$<Type>.<member>; declarations inside methods and code blocks are <ownerId>$<name> where the owner is\n// the method's id or <transitionOrActionId>~<n> for the n-th code block.\n\nimport type { Declaration, Effect, LocalAction, Program, Region, SclStatement, State } from '../types'\n\nexport function assignIds(program: Program) {\n const charts = new Map<string, number>()\n for (const chart of program.charts) {\n const n = (charts.get(chart.name) ?? 0) + 1\n charts.set(chart.name, n)\n assignState(chart, n === 1 ? chart.name : `${chart.name}#${n}`)\n }\n}\n\nfunction unique(base: string, used: Map<string, number>): string {\n const n = (used.get(base) ?? 0) + 1\n used.set(base, n)\n return n === 1 ? base : `${base}#${n}`\n}\n\nfunction assignDeclarations(declarations: Declaration[], scopeId: string, used: Map<string, number>) {\n for (const d of declarations) {\n for (const vo of d.valuedObjects) vo.id = unique(`${scopeId}$${vo.name}`, used)\n if (d.members) {\n const typeName = d.className ?? d.valuedObjects[0]?.name ?? '?'\n const memberScope = `${scopeId}$${typeName}`\n const memberUsed = new Map<string, number>()\n for (const m of d.members) {\n for (const vo of m.valuedObjects) vo.id = unique(`${memberScope}.${vo.name}`, memberUsed)\n if (m.declKind === 'method') assignMethod(m)\n if (m.members) assignDeclarations(m.members, `${memberScope}.${m.className ?? m.valuedObjects[0]?.name ?? '?'}`, new Map())\n }\n }\n if (d.declKind === 'method') assignMethod(d)\n for (const p of d.policies ?? []) assignPolicy(p, `${scopeId}$${d.className ?? '?'}:policy.${p.name ?? ''}`)\n }\n}\n\n/** Policy regions: <ownerId>:policy.<name>, their states <regionId>.<state>. */\nfunction assignPolicy(region: Region, regionId: string) {\n region.id = regionId\n assignDeclarations(region.declarations, regionId, new Map())\n const used = new Map<string, number>()\n for (const s of region.states) {\n s.id = unique(`${regionId}.${s.name}`, used)\n s.transitions.forEach((t, i) => {\n t.priority = i + 1\n t.source = s.id\n t.id = `${s.id}->${t.priority}`\n })\n }\n}\n\nfunction assignMethod(d: Declaration) {\n const methodId = d.valuedObjects[0]?.id ?? '?'\n const used = new Map<string, number>()\n if (d.parameters) assignDeclarations(d.parameters, methodId, used)\n if (d.body) {\n assignDeclarations(d.body.declarations, methodId, used)\n assignStatements(d.body.statements, methodId, used, { n: 0 })\n }\n}\n\nfunction assignStatements(statements: SclStatement[], ownerId: string, used: Map<string, number>, counter: { n: number }) {\n for (const s of statements) {\n if (s.kind === 'block' || s.kind === 'while') {\n assignDeclarations(s.declarations, ownerId, used)\n assignStatements(s.statements, ownerId, used, counter)\n } else if (s.kind === 'if') {\n assignDeclarations(s.declarations, ownerId, used)\n assignStatements(s.statements, ownerId, used, counter)\n if (s.else) {\n assignDeclarations(s.else.declarations, ownerId, used)\n assignStatements(s.else.statements, ownerId, used, counter)\n }\n } else if (s.kind === 'for') {\n if (s.init && s.init.kind === 'declaration') assignDeclarations([s.init], ownerId, used)\n assignDeclarations(s.declarations, ownerId, used)\n assignStatements(s.statements, ownerId, used, counter)\n }\n }\n}\n\nfunction assignEffects(effects: Effect[], ownerId: string) {\n let n = 0\n for (const e of effects) {\n if (e.kind !== 'code') continue\n const blockId = `${ownerId}~${n++}`\n const used = new Map<string, number>()\n if (e.declarations) assignDeclarations(e.declarations, blockId, used)\n if (e.statements) assignStatements(e.statements, blockId, used, { n: 0 })\n }\n}\n\nfunction assignActions(actions: LocalAction[], ownerId: string) {\n const counts = new Map<string, number>()\n for (const a of actions) {\n const n = counts.get(a.kind) ?? 0\n counts.set(a.kind, n + 1)\n a.id = `${ownerId}!${a.kind}${n}`\n assignEffects(a.effects, a.id)\n }\n}\n\nfunction assignState(state: State, id: string) {\n state.id = id\n const declUsed = new Map<string, number>()\n assignDeclarations(state.declarations, id, declUsed)\n assignActions(state.actions, id)\n\n // Region ids: the name, or the index (also for a repeated name).\n const regionNames = new Set<string>()\n const regionIds = state.regions.map((r, i) => {\n if (r.name !== undefined && r.name !== '' && !regionNames.has(r.name)) {\n regionNames.add(r.name)\n return `${id}:${r.name}`\n }\n return `${id}:${i}`\n })\n // A state name that occurs in more than one region of this parent is qualified by its region.\n const regionsOfName = new Map<string, Set<number>>()\n state.regions.forEach((r, i) => {\n for (const s of r.states) {\n const set = regionsOfName.get(s.name) ?? new Set<number>()\n set.add(i)\n regionsOfName.set(s.name, set)\n }\n })\n state.regions.forEach((r, i) => assignRegion(r, regionIds[i], id, regionsOfName))\n\n state.transitions.forEach((t, i) => {\n t.priority = i + 1\n t.source = id\n t.id = `${id}->${t.priority}`\n assignEffects(t.effects, t.id)\n })\n for (const p of state.policies ?? []) assignPolicy(p, `${id}:policy.${p.name ?? ''}`)\n}\n\nfunction assignRegion(region: Region, regionId: string, parentId: string, regionsOfName: Map<string, Set<number>>) {\n region.id = regionId\n const used = new Map<string, number>()\n if (region.forLoop) used.set(`${regionId}$${region.forLoop.variable}`, 1)\n assignDeclarations(region.declarations, regionId, used)\n assignActions(region.actions, regionId)\n const stateUsed = new Map<string, number>()\n for (const s of region.states) {\n if (s.name === '') {\n assignState(s, unique(`${regionId}._`, stateUsed))\n continue\n }\n const base = (regionsOfName.get(s.name)?.size ?? 0) > 1 ? `${regionId}.${s.name}` : `${parentId}.${s.name}`\n assignState(s, unique(base, stateUsed))\n }\n}\n\n/** Id of a region's for-loop counter variable. */\nexport function counterId(region: Region): string {\n return `${region.id}$${region.forLoop?.variable ?? ''}`\n}\n"]}
|
|
@@ -0,0 +1,28 @@
|
|
|
1
|
+
// Which files an `import` loads (structure.md S-20), as KIELER resolves them: relative to the importing file's folder;
|
|
2
|
+
// `import "beep"` and `import "beep.sctx"` load beep.sctx, `import "dir/*"` the .sctx files directly in dir (not in
|
|
3
|
+
// its subfolders, probe tests/engine/kieler/imports/probe-import-folder-nested). A file never imports itself.
|
|
4
|
+
/** The paths among `files` that `import "name"` in the file `from` loads (`from` is '' for the main file). */
|
|
5
|
+
export function importTargets(name, from, files) {
|
|
6
|
+
const dir = from.includes('/') ? from.slice(0, from.lastIndexOf('/') + 1) : '';
|
|
7
|
+
if (name.endsWith('*')) {
|
|
8
|
+
const folder = normalise(dir + name.slice(0, -1));
|
|
9
|
+
const prefix = folder ? `${folder}/` : '';
|
|
10
|
+
return files.filter(f => f !== from && f.startsWith(prefix) && !f.slice(prefix.length).includes('/') && f.endsWith('.sctx'));
|
|
11
|
+
}
|
|
12
|
+
const target = normalise(dir + (name.endsWith('.sctx') ? name : `${name}.sctx`));
|
|
13
|
+
return target !== from && files.includes(target) ? [target] : [];
|
|
14
|
+
}
|
|
15
|
+
/** `a/./b/../c` as `a/c`. Paths are relative to the main file, so they may start with `..` (a file above it). */
|
|
16
|
+
function normalise(path) {
|
|
17
|
+
const out = [];
|
|
18
|
+
for (const part of path.replace(/\\/g, '/').split('/')) {
|
|
19
|
+
if (part === '' || part === '.')
|
|
20
|
+
continue;
|
|
21
|
+
if (part === '..' && out.length && out[out.length - 1] !== '..')
|
|
22
|
+
out.pop();
|
|
23
|
+
else
|
|
24
|
+
out.push(part);
|
|
25
|
+
}
|
|
26
|
+
return out.join('/');
|
|
27
|
+
}
|
|
28
|
+
//# sourceMappingURL=imports.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"imports.js","sourceRoot":"","sources":["../../src/parser/imports.ts"],"names":[],"mappings":"AAAA,uHAAuH;AACvH,oHAAoH;AACpH,8GAA8G;AAE9G,8GAA8G;AAC9G,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,IAAY,EAAE,KAAe;IACrE,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC9E,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QACjD,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;QACzC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAA;IAChI,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAA;IAChF,OAAO,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;AACpE,CAAC;AAED,iHAAiH;AACjH,SAAS,SAAS,CAAC,IAAY;IAC3B,MAAM,GAAG,GAAa,EAAE,CAAA;IACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACrD,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,GAAG;YAAE,SAAQ;QACzC,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI;YAAE,GAAG,CAAC,GAAG,EAAE,CAAA;;YACrE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC","sourcesContent":["// Which files an `import` loads (structure.md S-20), as KIELER resolves them: relative to the importing file's folder;\n// `import \"beep\"` and `import \"beep.sctx\"` load beep.sctx, `import \"dir/*\"` the .sctx files directly in dir (not in\n// its subfolders, probe tests/engine/kieler/imports/probe-import-folder-nested). A file never imports itself.\n\n/** The paths among `files` that `import \"name\"` in the file `from` loads (`from` is '' for the main file). */\nexport function importTargets(name: string, from: string, files: string[]): string[] {\n const dir = from.includes('/') ? from.slice(0, from.lastIndexOf('/') + 1) : ''\n if (name.endsWith('*')) {\n const folder = normalise(dir + name.slice(0, -1))\n const prefix = folder ? `${folder}/` : ''\n return files.filter(f => f !== from && f.startsWith(prefix) && !f.slice(prefix.length).includes('/') && f.endsWith('.sctx'))\n }\n const target = normalise(dir + (name.endsWith('.sctx') ? name : `${name}.sctx`))\n return target !== from && files.includes(target) ? [target] : []\n}\n\n/** `a/./b/../c` as `a/c`. Paths are relative to the main file, so they may start with `..` (a file above it). */\nfunction normalise(path: string): string {\n const out: string[] = []\n for (const part of path.replace(/\\\\/g, '/').split('/')) {\n if (part === '' || part === '.') continue\n if (part === '..' && out.length && out[out.length - 1] !== '..') out.pop()\n else out.push(part)\n }\n return out.join('/')\n}\n"]}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
import type { Expression, State, Value, VariableInfo } from "../types.js";
|
|
2
|
+
import type { ModelIndex } from "./resolve.js";
|
|
3
|
+
/**
|
|
4
|
+
* Inputs, outputs and local variables and signals declared at the top of a chart, in declaration order, with their
|
|
5
|
+
* types as declared (compile() reports a clock with KIELER's simulation type instead: float, or int with
|
|
6
|
+
* @IntegerClockType). Methods, classes, enums, references (`ref`, except of enums: ints), extern declarations and schedules are not included.
|
|
7
|
+
*/
|
|
8
|
+
export declare function extractInterface(chart: State, index?: ModelIndex): VariableInfo[];
|
|
9
|
+
/** Value of a constant expression, or undefined when it is not constant (or not computable from the source). */
|
|
10
|
+
export declare function constantValue(e: Expression, index?: ModelIndex, depth?: number): Value | undefined;
|
|
@@ -0,0 +1,93 @@
|
|
|
1
|
+
// The variables of a chart as the simulator and the widgets show them (VariableInfo), with constant values
|
|
2
|
+
// evaluated where the source allows it (literals, negated numbers, vectors and references to constants).
|
|
3
|
+
/**
|
|
4
|
+
* Inputs, outputs and local variables and signals declared at the top of a chart, in declaration order, with their
|
|
5
|
+
* types as declared (compile() reports a clock with KIELER's simulation type instead: float, or int with
|
|
6
|
+
* @IntegerClockType). Methods, classes, enums, references (`ref`, except of enums: ints), extern declarations and schedules are not included.
|
|
7
|
+
*/
|
|
8
|
+
export function extractInterface(chart, index) {
|
|
9
|
+
const out = [];
|
|
10
|
+
for (const d of chart.declarations) {
|
|
11
|
+
// `ref E x` of an enum E is an int (KIELER's Enum processor; host enums keep C's type and are left out).
|
|
12
|
+
const target = d.declKind === 'reference' ? index?.refTargets.get(d) : undefined;
|
|
13
|
+
const enumRef = !!target && target.kind === 'declaration' && target.declKind === 'enum' && !target.host;
|
|
14
|
+
if (d.declKind !== 'variable' && !enumRef)
|
|
15
|
+
continue;
|
|
16
|
+
for (const vo of d.valuedObjects) {
|
|
17
|
+
const type = enumRef ? 'int' : d.type ?? 'pure';
|
|
18
|
+
const info = {
|
|
19
|
+
name: vo.name,
|
|
20
|
+
id: vo.id,
|
|
21
|
+
type,
|
|
22
|
+
signal: d.signal,
|
|
23
|
+
valued: d.signal && type !== 'pure',
|
|
24
|
+
input: d.input,
|
|
25
|
+
output: d.output,
|
|
26
|
+
const: d.const,
|
|
27
|
+
dims: vo.cardinalities.map(c => {
|
|
28
|
+
const v = constantValue(c, index);
|
|
29
|
+
return typeof v === 'number' ? v : -1;
|
|
30
|
+
}),
|
|
31
|
+
};
|
|
32
|
+
if (vo.combine)
|
|
33
|
+
info.combine = vo.combine;
|
|
34
|
+
if (vo.initialValue) {
|
|
35
|
+
const v = constantValue(vo.initialValue, index);
|
|
36
|
+
if (v !== undefined)
|
|
37
|
+
info.initialValue = v;
|
|
38
|
+
}
|
|
39
|
+
out.push(info);
|
|
40
|
+
}
|
|
41
|
+
}
|
|
42
|
+
return out;
|
|
43
|
+
}
|
|
44
|
+
/** Value of a constant expression, or undefined when it is not constant (or not computable from the source). */
|
|
45
|
+
export function constantValue(e, index, depth = 0) {
|
|
46
|
+
if (depth > 20)
|
|
47
|
+
return undefined;
|
|
48
|
+
switch (e.kind) {
|
|
49
|
+
case 'bool':
|
|
50
|
+
case 'int':
|
|
51
|
+
case 'float':
|
|
52
|
+
case 'string': return e.value;
|
|
53
|
+
case 'null': return null;
|
|
54
|
+
case 'vector': {
|
|
55
|
+
if (e.range)
|
|
56
|
+
return undefined;
|
|
57
|
+
const values = [];
|
|
58
|
+
for (const v of e.values) {
|
|
59
|
+
const c = constantValue(v, index, depth + 1);
|
|
60
|
+
if (c === undefined)
|
|
61
|
+
return undefined;
|
|
62
|
+
values.push(c);
|
|
63
|
+
}
|
|
64
|
+
return values;
|
|
65
|
+
}
|
|
66
|
+
case 'op': {
|
|
67
|
+
if (e.op === 'neg' && e.args.length === 1) {
|
|
68
|
+
const v = constantValue(e.args[0], index, depth + 1);
|
|
69
|
+
return typeof v === 'number' ? -v : undefined;
|
|
70
|
+
}
|
|
71
|
+
return undefined;
|
|
72
|
+
}
|
|
73
|
+
case 'ref': {
|
|
74
|
+
// An enum value: its position in the enum.
|
|
75
|
+
if (index && e.decl && e.sub?.decl) {
|
|
76
|
+
const en = index.vos.get(e.decl)?.decl;
|
|
77
|
+
if (en?.declKind === 'enum' && !en.host) {
|
|
78
|
+
const i = (en.members?.[0]?.valuedObjects ?? []).findIndex(vo => vo.id === e.sub.decl);
|
|
79
|
+
return i < 0 ? undefined : i;
|
|
80
|
+
}
|
|
81
|
+
}
|
|
82
|
+
if (!index || !e.decl || e.indices.length || e.sub)
|
|
83
|
+
return undefined;
|
|
84
|
+
const entry = index.vos.get(e.decl);
|
|
85
|
+
const d = entry?.decl;
|
|
86
|
+
if (!d || d.declKind !== 'variable' || !d.const || !entry.vo.initialValue)
|
|
87
|
+
return undefined;
|
|
88
|
+
return constantValue(entry.vo.initialValue, index, depth + 1);
|
|
89
|
+
}
|
|
90
|
+
default: return undefined;
|
|
91
|
+
}
|
|
92
|
+
}
|
|
93
|
+
//# sourceMappingURL=interface.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"interface.js","sourceRoot":"","sources":["../../src/parser/interface.ts"],"names":[],"mappings":"AAAA,2GAA2G;AAC3G,yGAAyG;AAKzG;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAY,EAAE,KAAkB;IAC7D,MAAM,GAAG,GAAmB,EAAE,CAAA;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACjC,yGAAyG;QACzG,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;QAChF,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,aAAa,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAAA;QACvG,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU,IAAI,CAAC,OAAO;YAAE,SAAQ;QACnD,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,MAAM,CAAA;YAC/C,MAAM,IAAI,GAAiB;gBACvB,IAAI,EAAE,EAAE,CAAC,IAAI;gBACb,EAAE,EAAE,EAAE,CAAC,EAAE;gBACT,IAAI;gBACJ,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,KAAK,MAAM;gBACnC,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;oBAC3B,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;oBACjC,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACzC,CAAC,CAAC;aACL,CAAA;YACD,IAAI,EAAE,CAAC,OAAO;gBAAE,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAA;YACzC,IAAI,EAAE,CAAC,YAAY,EAAE,CAAC;gBAClB,MAAM,CAAC,GAAG,aAAa,CAAC,EAAE,CAAC,YAAY,EAAE,KAAK,CAAC,CAAA;gBAC/C,IAAI,CAAC,KAAK,SAAS;oBAAE,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA;YAC9C,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClB,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC;AAED,gHAAgH;AAChH,MAAM,UAAU,aAAa,CAAC,CAAa,EAAE,KAAkB,EAAE,KAAK,GAAG,CAAC;IACtE,IAAI,KAAK,GAAG,EAAE;QAAE,OAAO,SAAS,CAAA;IAChC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC;QAAC,KAAK,KAAK,CAAC;QAAC,KAAK,OAAO,CAAC;QAAC,KAAK,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAA;QACpE,KAAK,MAAM,CAAC,CAAC,OAAO,IAAI,CAAA;QACxB,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,KAAK;gBAAE,OAAO,SAAS,CAAA;YAC7B,MAAM,MAAM,GAAY,EAAE,CAAA;YAC1B,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;gBAC5C,IAAI,CAAC,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAA;gBACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YAClB,CAAC;YACD,OAAO,MAAM,CAAA;QACjB,CAAC;QACD,KAAK,IAAI,CAAC,CAAC,CAAC;YACR,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;gBACpD,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;YACjD,CAAC;YACD,OAAO,SAAS,CAAA;QACpB,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACT,2CAA2C;YAC3C,IAAI,KAAK,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC;gBACjC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAA;gBACtC,IAAI,EAAE,EAAE,QAAQ,KAAK,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;oBACtC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,IAAI,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAI,CAAC,IAAI,CAAC,CAAA;oBACvF,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;gBAChC,CAAC;YACL,CAAC;YACD,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAA;YACpE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YACnC,MAAM,CAAC,GAA4B,KAAK,EAAE,IAAI,CAAA;YAC9C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,KAAK,UAAU,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,KAAM,CAAC,EAAE,CAAC,YAAY;gBAAE,OAAO,SAAS,CAAA;YAC5F,OAAO,aAAa,CAAC,KAAM,CAAC,EAAE,CAAC,YAAY,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;QAClE,CAAC;QACD,OAAO,CAAC,CAAC,OAAO,SAAS,CAAA;IAC7B,CAAC;AACL,CAAC","sourcesContent":["// The variables of a chart as the simulator and the widgets show them (VariableInfo), with constant values\n// evaluated where the source allows it (literals, negated numbers, vectors and references to constants).\n\nimport type { Declaration, Expression, State, Value, VariableInfo } from '../types'\nimport type { ModelIndex } from './resolve'\n\n/**\n * Inputs, outputs and local variables and signals declared at the top of a chart, in declaration order, with their\n * types as declared (compile() reports a clock with KIELER's simulation type instead: float, or int with\n * @IntegerClockType). Methods, classes, enums, references (`ref`, except of enums: ints), extern declarations and schedules are not included.\n */\nexport function extractInterface(chart: State, index?: ModelIndex): VariableInfo[] {\n const out: VariableInfo[] = []\n for (const d of chart.declarations) {\n // `ref E x` of an enum E is an int (KIELER's Enum processor; host enums keep C's type and are left out).\n const target = d.declKind === 'reference' ? index?.refTargets.get(d) : undefined\n const enumRef = !!target && target.kind === 'declaration' && target.declKind === 'enum' && !target.host\n if (d.declKind !== 'variable' && !enumRef) continue\n for (const vo of d.valuedObjects) {\n const type = enumRef ? 'int' : d.type ?? 'pure'\n const info: VariableInfo = {\n name: vo.name,\n id: vo.id,\n type,\n signal: d.signal,\n valued: d.signal && type !== 'pure',\n input: d.input,\n output: d.output,\n const: d.const,\n dims: vo.cardinalities.map(c => {\n const v = constantValue(c, index)\n return typeof v === 'number' ? v : -1\n }),\n }\n if (vo.combine) info.combine = vo.combine\n if (vo.initialValue) {\n const v = constantValue(vo.initialValue, index)\n if (v !== undefined) info.initialValue = v\n }\n out.push(info)\n }\n }\n return out\n}\n\n/** Value of a constant expression, or undefined when it is not constant (or not computable from the source). */\nexport function constantValue(e: Expression, index?: ModelIndex, depth = 0): Value | undefined {\n if (depth > 20) return undefined\n switch (e.kind) {\n case 'bool': case 'int': case 'float': case 'string': return e.value\n case 'null': return null\n case 'vector': {\n if (e.range) return undefined\n const values: Value[] = []\n for (const v of e.values) {\n const c = constantValue(v, index, depth + 1)\n if (c === undefined) return undefined\n values.push(c)\n }\n return values\n }\n case 'op': {\n if (e.op === 'neg' && e.args.length === 1) {\n const v = constantValue(e.args[0], index, depth + 1)\n return typeof v === 'number' ? -v : undefined\n }\n return undefined\n }\n case 'ref': {\n // An enum value: its position in the enum.\n if (index && e.decl && e.sub?.decl) {\n const en = index.vos.get(e.decl)?.decl\n if (en?.declKind === 'enum' && !en.host) {\n const i = (en.members?.[0]?.valuedObjects ?? []).findIndex(vo => vo.id === e.sub!.decl)\n return i < 0 ? undefined : i\n }\n }\n if (!index || !e.decl || e.indices.length || e.sub) return undefined\n const entry = index.vos.get(e.decl)\n const d: Declaration | undefined = entry?.decl\n if (!d || d.declKind !== 'variable' || !d.const || !entry!.vo.initialValue) return undefined\n return constantValue(entry!.vo.initialValue, index, depth + 1)\n }\n default: return undefined\n }\n}\n"]}
|
|
@@ -0,0 +1,196 @@
|
|
|
1
|
+
// KIELER's own words for a syntax error in one expression or effect (parseExpression, index.ts): what KIELER's
|
|
2
|
+
// parser says when the text is written as a trigger (`if <text> go to S`) or as an effect (`do <text> go to S`).
|
|
3
|
+
//
|
|
4
|
+
// KIELER's parser is ANTLR 3 with backtracking: where a decision needs a syntactic predicate and every alternative
|
|
5
|
+
// fails, it reports "no viable alternative at input 'X'" at the token where the decision started, which is not
|
|
6
|
+
// always the token the guide's parser stops at. The first rules (afterPrefix) were fitted to KIELER on 920 broken
|
|
7
|
+
// expressions and effects and checked on another 600; the second (recovered) were fitted on the texts the first left
|
|
8
|
+
// open and checked on 1500 fresh ones (tests/engine/expression.test.ts, tools/oracle recordings in
|
|
9
|
+
// tests/engine/kieler/expressions/wording.json). Each says something only for a shape where it agreed with KIELER
|
|
10
|
+
// every time, and nothing otherwise (the guide's message stands alone then).
|
|
11
|
+
import { lex } from "./lexer.js";
|
|
12
|
+
import { parseStandalone } from "./parser.js";
|
|
13
|
+
const BINARY = new Set(['+', '-', '*', '/', '%', '==', '!=', '<', '<=', '>', '>=', '&&', '||', '&', '|', '^', '<<', '>>', '>>>', '->', 'fby', 'sfby']);
|
|
14
|
+
const COMPARISON = new Set(['==', '!=', '<', '<=', '>', '>=']);
|
|
15
|
+
const ASSIGN = new Set(['=', '+=', '-=', '*=', '/=', '%=', '&=', '|=', '^=', '<<=', '>>=', '>>>=', 'min=', 'max=']);
|
|
16
|
+
/** Tokens that can start a value: where the text starts with one, KIELER's error lies deeper. */
|
|
17
|
+
const OPERAND = new Set(['ID', 'INT', 'FLOAT', 'BOOLEAN', 'STRING', 'HOSTCODE', '(', '()', '!', '-', '~', 'pre', 'val', 'random', 'print', 'randomize', '{']);
|
|
18
|
+
/** Tokens the transition around the text continues with (`if A do ...`, `if A go to ...`). */
|
|
19
|
+
const CONTEXT = new Set(['do', 'go', 'abort', 'join', 'to', 'if', 'Pr=', 'nondeterministic']);
|
|
20
|
+
/** At most this many tokens are looked at (the prefix search parses every prefix). */
|
|
21
|
+
const LIMIT = 80;
|
|
22
|
+
const noViable = (text, t) => `no viable alternative at input '${t ? text.slice(t.start, t.end) : 'go'}'`;
|
|
23
|
+
const ARITHMETIC = new Set(['+', '-', '*', '/', '%']);
|
|
24
|
+
const LOGICAL = new Set(['&', '|', '^', '&&', '||', '==', '!=', '<', '<=', '>', '>=']);
|
|
25
|
+
const VALUE_END = new Set(['ID', 'INT', 'FLOAT', 'BOOLEAN', 'STRING', ')', ']']);
|
|
26
|
+
const LITERAL = new Set(['ID', 'INT', 'FLOAT', 'BOOLEAN']);
|
|
27
|
+
const reads = (text, as) => !parseStandalone(text, as).diagnostics.some(d => d.severity === 'error');
|
|
28
|
+
/** KIELER's message for the first syntax error of `text` read as `as`, when the shape is one whose message is known. */
|
|
29
|
+
export function kielerSyntaxWording(text, as) {
|
|
30
|
+
const toks = lex(text).tokens.filter(t => t.kind !== 'EOF');
|
|
31
|
+
if (!toks.length || toks.length > LIMIT || toks.some(t => t.kind === 'ANY_OTHER'))
|
|
32
|
+
return undefined;
|
|
33
|
+
// The longest prefix that is a whole expression (effect): where KIELER's reading ends.
|
|
34
|
+
let p = 0;
|
|
35
|
+
for (let n = toks.length - 1; n >= 1; n--) {
|
|
36
|
+
if (reads(text.slice(0, toks[n - 1].end), as)) {
|
|
37
|
+
p = n;
|
|
38
|
+
break;
|
|
39
|
+
}
|
|
40
|
+
}
|
|
41
|
+
return afterPrefix(text, as, toks, p) ?? recovered(text, as, toks, p);
|
|
42
|
+
}
|
|
43
|
+
/** The first rules (fitted on 920 texts): what KIELER says about the token after the prefix that reads. */
|
|
44
|
+
function afterPrefix(text, as, toks, p) {
|
|
45
|
+
const next = toks[p];
|
|
46
|
+
if (p === 0) {
|
|
47
|
+
if (!next || OPERAND.has(next.kind))
|
|
48
|
+
return undefined;
|
|
49
|
+
return noViable(text, next);
|
|
50
|
+
}
|
|
51
|
+
// Words that go on the transition around the text: what KIELER says next depends on that transition.
|
|
52
|
+
if (!next || CONTEXT.has(next.kind))
|
|
53
|
+
return undefined;
|
|
54
|
+
// `!a + b`: `!` takes one value, so KIELER stops at the operator, but only if what follows it reads.
|
|
55
|
+
if ((toks[0].kind === '!' || toks[0].kind === '~') && BINARY.has(next.kind)) {
|
|
56
|
+
const rest = parseStandalone(text.slice(next.end), 'expression');
|
|
57
|
+
if (rest.diagnostics.some(d => d.severity === 'error'))
|
|
58
|
+
return undefined;
|
|
59
|
+
}
|
|
60
|
+
let depth = 0;
|
|
61
|
+
let binary = 0;
|
|
62
|
+
let comparisons = 0;
|
|
63
|
+
let assign;
|
|
64
|
+
let ternary = 0;
|
|
65
|
+
for (const [i, t] of toks.slice(0, p).entries()) {
|
|
66
|
+
if (t.kind === '(' || t.kind === '[')
|
|
67
|
+
depth++;
|
|
68
|
+
else if (t.kind === ')' || t.kind === ']')
|
|
69
|
+
depth--;
|
|
70
|
+
else if (depth > 0)
|
|
71
|
+
continue;
|
|
72
|
+
else if (t.kind === '?' || t.kind === ':') {
|
|
73
|
+
// Only a whole `c ? a : b` at the end of what was read (KIELER's three atoms).
|
|
74
|
+
if (t.kind === ':' && i === p - 2 && toks[i - 2]?.kind === '?')
|
|
75
|
+
ternary++;
|
|
76
|
+
else if (!(t.kind === '?' && i === p - 4 && toks[p - 2]?.kind === ':'))
|
|
77
|
+
return undefined;
|
|
78
|
+
}
|
|
79
|
+
else if (t.kind === ';' || t.kind === ',')
|
|
80
|
+
return undefined;
|
|
81
|
+
else if (ASSIGN.has(t.kind))
|
|
82
|
+
assign ??= t;
|
|
83
|
+
else if (BINARY.has(t.kind)) {
|
|
84
|
+
binary++;
|
|
85
|
+
if (COMPARISON.has(t.kind))
|
|
86
|
+
comparisons++;
|
|
87
|
+
}
|
|
88
|
+
}
|
|
89
|
+
if (depth !== 0 || next.kind === '[' || next.kind === ';')
|
|
90
|
+
return undefined;
|
|
91
|
+
if (ternary)
|
|
92
|
+
return binary === 0 && !assign === (as === 'expression') && (next.kind === '?' || next.kind === ':') ? noViable(text, next) : undefined;
|
|
93
|
+
// A comparison chain: `a < b < c` stops at the second comparison; a stray `)` after a whole expression.
|
|
94
|
+
if (binary === 1 && comparisons === 1 && COMPARISON.has(next.kind))
|
|
95
|
+
return noViable(text, next);
|
|
96
|
+
if (next.kind === ')')
|
|
97
|
+
return noViable(text, next);
|
|
98
|
+
if (as === 'expression')
|
|
99
|
+
return binary === 0 ? noViable(text, next) : undefined;
|
|
100
|
+
if (binary > 0)
|
|
101
|
+
return undefined;
|
|
102
|
+
// `x = 1 +`: the right-hand side goes on but breaks further on; KIELER names the assignment operator.
|
|
103
|
+
if (assign && (BINARY.has(next.kind) || next.kind === '?'))
|
|
104
|
+
return undefined;
|
|
105
|
+
return noViable(text, next);
|
|
106
|
+
}
|
|
107
|
+
/**
|
|
108
|
+
* The second rules (fitted on the texts the first leave open, checked on 1500 more): ANTLR's single-token recovery
|
|
109
|
+
* at the start (`print x`, `pre - (a)`), one unclosed parenthesis, and the decision KIELER backtracks to for an
|
|
110
|
+
* index, a stray value or a call after a whole expression.
|
|
111
|
+
*/
|
|
112
|
+
function recovered(text, as, toks, p) {
|
|
113
|
+
const first = toks[0];
|
|
114
|
+
const second = toks[1];
|
|
115
|
+
// `print x` (an effect) and `pre - (a)` (an expression): a missing `(` is inserted before a value, an extra
|
|
116
|
+
// token before `(` is skipped.
|
|
117
|
+
if (((first.kind === 'print' && as === 'effect') || (first.kind === 'pre' && as === 'expression')) && second && second.kind !== '(' && second.kind !== '()') {
|
|
118
|
+
if (toks[2]?.kind === '(')
|
|
119
|
+
return `extraneous input '${text.slice(second.start, second.end)}' expecting '('`;
|
|
120
|
+
if (OPERAND.has(second.kind))
|
|
121
|
+
return `missing '(' at '${text.slice(second.start, second.end)}'`;
|
|
122
|
+
return undefined;
|
|
123
|
+
}
|
|
124
|
+
// A prefix operator (or, in an expression, `(`) followed by something that cannot start a value.
|
|
125
|
+
if ((first.kind === '(' || (as === 'expression' && (first.kind === '!' || first.kind === '~' || first.kind === '-'))) && second && !OPERAND.has(second.kind)) {
|
|
126
|
+
return noViable(text, second);
|
|
127
|
+
}
|
|
128
|
+
// `(a + b` and `print(x`: one parenthesis left open where the text starts; KIELER finds `go` in its place.
|
|
129
|
+
let depth = 0;
|
|
130
|
+
let outer = -1;
|
|
131
|
+
for (const [i, t] of toks.entries()) {
|
|
132
|
+
if (t.kind === '(') {
|
|
133
|
+
if (depth === 0)
|
|
134
|
+
outer = i;
|
|
135
|
+
depth++;
|
|
136
|
+
}
|
|
137
|
+
else if (t.kind === ')')
|
|
138
|
+
depth--;
|
|
139
|
+
if (depth < 0)
|
|
140
|
+
break;
|
|
141
|
+
}
|
|
142
|
+
if (depth === 1 && (outer === 0 || (outer === 1 && first.kind === 'print')) && reads(text + ')', as))
|
|
143
|
+
return "missing ')' at 'go'";
|
|
144
|
+
if (p === 0)
|
|
145
|
+
return undefined;
|
|
146
|
+
const next = toks[p];
|
|
147
|
+
const ops = operatorsBefore(toks, p);
|
|
148
|
+
// `a[` after a lone value: KIELER names the bracket.
|
|
149
|
+
if (as === 'expression' && next.kind === '[')
|
|
150
|
+
return ops.length === 0 && !['-', '!', '~'].includes(first.kind) ? noViable(text, next) : undefined;
|
|
151
|
+
// A value right after a whole expression (`a b`, `x = 1 2`): KIELER names it, unless arithmetic or a
|
|
152
|
+
// conditional came first (it may then backtrack to those).
|
|
153
|
+
if (LITERAL.has(next.kind))
|
|
154
|
+
return ops.some(o => ARITHMETIC.has(o.kind) || o.kind === '?' || o.kind === ':') ? undefined : noViable(text, next);
|
|
155
|
+
// A call after a whole expression (`b | f ( / x )`): after a comparison or a logical operator KIELER names the
|
|
156
|
+
// `(`; after `?` the `?`; after arithmetic the first operator of that arithmetic.
|
|
157
|
+
if (next.kind === '(') {
|
|
158
|
+
const binary = ops.filter(o => !ASSIGN.has(o.kind));
|
|
159
|
+
const last = binary.at(-1);
|
|
160
|
+
if (!last)
|
|
161
|
+
return undefined;
|
|
162
|
+
if (last.kind === '?')
|
|
163
|
+
return noViable(text, last);
|
|
164
|
+
// Inside a conditional KIELER may backtrack to its `?`.
|
|
165
|
+
if (binary.some(o => o.kind === '?' || o.kind === ':'))
|
|
166
|
+
return undefined;
|
|
167
|
+
if (LOGICAL.has(last.kind))
|
|
168
|
+
return noViable(text, next);
|
|
169
|
+
if (ARITHMETIC.has(last.kind)) {
|
|
170
|
+
let i = binary.length - 1;
|
|
171
|
+
while (i > 0 && ARITHMETIC.has(binary[i - 1].kind))
|
|
172
|
+
i--;
|
|
173
|
+
return noViable(text, binary[i]);
|
|
174
|
+
}
|
|
175
|
+
}
|
|
176
|
+
return undefined;
|
|
177
|
+
}
|
|
178
|
+
/** The binary and assignment operators outside brackets in toks[0, p) (prefix `-`, `!` and `~` left out). */
|
|
179
|
+
function operatorsBefore(toks, p) {
|
|
180
|
+
const out = [];
|
|
181
|
+
let depth = 0;
|
|
182
|
+
for (let i = 0; i < p; i++) {
|
|
183
|
+
const t = toks[i];
|
|
184
|
+
if (t.kind === '(' || t.kind === '[')
|
|
185
|
+
depth++;
|
|
186
|
+
else if (t.kind === ')' || t.kind === ']')
|
|
187
|
+
depth--;
|
|
188
|
+
else if (depth === 0) {
|
|
189
|
+
const prefix = ['-', '!', '~'].includes(t.kind) && !VALUE_END.has(toks[i - 1]?.kind ?? '');
|
|
190
|
+
if (!prefix && (ASSIGN.has(t.kind) || ARITHMETIC.has(t.kind) || LOGICAL.has(t.kind) || ['?', ':', '<<', '>>', '>>>', '->', 'fby', 'sfby'].includes(t.kind)))
|
|
191
|
+
out.push(t);
|
|
192
|
+
}
|
|
193
|
+
}
|
|
194
|
+
return out;
|
|
195
|
+
}
|
|
196
|
+
//# sourceMappingURL=kielerWording.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"kielerWording.js","sourceRoot":"","sources":["../../src/parser/kielerWording.ts"],"names":[],"mappings":"AAAA,+GAA+G;AAC/G,iHAAiH;AACjH,EAAE;AACF,mHAAmH;AACnH,+GAA+G;AAC/G,kHAAkH;AAClH,qHAAqH;AACrH,mGAAmG;AACnG,kHAAkH;AAClH,6EAA6E;AAE7E,OAAO,EAAE,GAAG,EAAc,mBAAe;AACzC,OAAO,EAAE,eAAe,EAAE,oBAAgB;AAE1C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAA;AACtJ,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;AAC9D,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;AACnH,iGAAiG;AACjG,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC,CAAA;AAE7J,8FAA8F;AAC9F,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAA;AAE7F,sFAAsF;AACtF,MAAM,KAAK,GAAG,EAAE,CAAA;AAEhB,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,CAAoB,EAAE,EAAE,CAAC,mCAAmC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAA;AAEpI,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;AACrD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;AACtF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;AAChF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAA;AAE1D,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,EAA2B,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAA;AAErI,wHAAwH;AACxH,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,EAA2B;IACzE,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAA;IAC3D,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC;QAAE,OAAO,SAAS,CAAA;IACnG,uFAAuF;IACvF,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAAC,CAAC,GAAG,CAAC,CAAC;YAAC,MAAK;QAAC,CAAC;IACnE,CAAC;IACD,OAAO,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;AACzE,CAAC;AAED,2GAA2G;AAC3G,SAAS,WAAW,CAAC,IAAY,EAAE,EAA2B,EAAE,IAAa,EAAE,CAAS;IACpF,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACpB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACV,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,SAAS,CAAA;QACrD,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC/B,CAAC;IACD,qGAAqG;IACrG,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAA;IACrD,qGAAqG;IACrG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1E,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,YAAY,CAAC,CAAA;QAChE,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC;YAAE,OAAO,SAAS,CAAA;IAC5E,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,MAAM,GAAG,CAAC,CAAA;IACd,IAAI,WAAW,GAAG,CAAC,CAAA;IACnB,IAAI,MAAyB,CAAA;IAC7B,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG;YAAE,KAAK,EAAE,CAAA;aACxC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG;YAAE,KAAK,EAAE,CAAA;aAC7C,IAAI,KAAK,GAAG,CAAC;YAAE,SAAQ;aACvB,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;YACxC,+EAA+E;YAC/E,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK,GAAG;gBAAE,OAAO,EAAE,CAAA;iBACpE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAA;QAC5F,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG;YAAE,OAAO,SAAS,CAAA;aACxD,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,MAAM,KAAK,CAAC,CAAA;aACpC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAAC,MAAM,EAAE,CAAC;YAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,WAAW,EAAE,CAAA;QAAC,CAAC;IACxF,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,SAAS,CAAA;IAC3E,IAAI,OAAO;QAAE,OAAO,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACpJ,wGAAwG;IACxG,IAAI,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC/F,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAClD,IAAI,EAAE,KAAK,YAAY;QAAE,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IAC/E,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IAChC,sGAAsG;IACtG,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,SAAS,CAAA;IAC5E,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AAC/B,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,IAAY,EAAE,EAA2B,EAAE,IAAa,EAAE,CAAS;IAClF,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACrB,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACtB,4GAA4G;IAC5G,+BAA+B;IAC/B,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,EAAE,KAAK,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,IAAI,EAAE,KAAK,YAAY,CAAC,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,GAAG,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QAC1J,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,KAAK,GAAG;YAAE,OAAO,qBAAqB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,iBAAiB,CAAA;QAC5G,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,OAAO,mBAAmB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAA;QAC/F,OAAO,SAAS,CAAA;IACpB,CAAC;IACD,iGAAiG;IACjG,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,EAAE,KAAK,YAAY,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3J,OAAO,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IACjC,CAAC;IACD,2GAA2G;IAC3G,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,IAAI,KAAK,GAAG,CAAC,CAAC,CAAA;IACd,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QAClC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;YAAC,IAAI,KAAK,KAAK,CAAC;gBAAE,KAAK,GAAG,CAAC,CAAC;YAAC,KAAK,EAAE,CAAA;QAAC,CAAC;aAAM,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG;YAAE,KAAK,EAAE,CAAA;QAC5F,IAAI,KAAK,GAAG,CAAC;YAAE,MAAK;IACxB,CAAC;IACD,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;QAAE,OAAO,qBAAqB,CAAA;IAClI,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAA;IAE7B,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;IACpB,MAAM,GAAG,GAAG,eAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACpC,qDAAqD;IACrD,IAAI,EAAE,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;QAAE,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACjJ,qGAAqG;IACrG,2DAA2D;IAC3D,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC/I,+GAA+G;IAC/G,kFAAkF;IAClF,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;QACpB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QACnD,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;QAC1B,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAA;QAC3B,IAAI,IAAI,CAAC,IAAI,KAAK,GAAG;YAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAClD,wDAAwD;QACxD,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC;YAAE,OAAO,SAAS,CAAA;QACxE,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACvD,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,CAAC,EAAE,CAAA;YACvD,OAAO,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;QACpC,CAAC;IACL,CAAC;IACD,OAAO,SAAS,CAAA;AACpB,CAAC;AAED,6GAA6G;AAC7G,SAAS,eAAe,CAAC,IAAa,EAAE,CAAS;IAC7C,MAAM,GAAG,GAAY,EAAE,CAAA;IACvB,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG;YAAE,KAAK,EAAE,CAAA;aACxC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG;YAAE,KAAK,EAAE,CAAA;aAC7C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,IAAI,EAAE,CAAC,CAAA;YAC1F,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5K,CAAC;IACL,CAAC;IACD,OAAO,GAAG,CAAA;AACd,CAAC","sourcesContent":["// KIELER's own words for a syntax error in one expression or effect (parseExpression, index.ts): what KIELER's\n// parser says when the text is written as a trigger (`if <text> go to S`) or as an effect (`do <text> go to S`).\n//\n// KIELER's parser is ANTLR 3 with backtracking: where a decision needs a syntactic predicate and every alternative\n// fails, it reports \"no viable alternative at input 'X'\" at the token where the decision started, which is not\n// always the token the guide's parser stops at. The first rules (afterPrefix) were fitted to KIELER on 920 broken\n// expressions and effects and checked on another 600; the second (recovered) were fitted on the texts the first left\n// open and checked on 1500 fresh ones (tests/engine/expression.test.ts, tools/oracle recordings in\n// tests/engine/kieler/expressions/wording.json). Each says something only for a shape where it agreed with KIELER\n// every time, and nothing otherwise (the guide's message stands alone then).\n\nimport { lex, type Token } from './lexer'\nimport { parseStandalone } from './parser'\n\nconst BINARY = new Set(['+', '-', '*', '/', '%', '==', '!=', '<', '<=', '>', '>=', '&&', '||', '&', '|', '^', '<<', '>>', '>>>', '->', 'fby', 'sfby'])\nconst COMPARISON = new Set(['==', '!=', '<', '<=', '>', '>='])\nconst ASSIGN = new Set(['=', '+=', '-=', '*=', '/=', '%=', '&=', '|=', '^=', '<<=', '>>=', '>>>=', 'min=', 'max='])\n/** Tokens that can start a value: where the text starts with one, KIELER's error lies deeper. */\nconst OPERAND = new Set(['ID', 'INT', 'FLOAT', 'BOOLEAN', 'STRING', 'HOSTCODE', '(', '()', '!', '-', '~', 'pre', 'val', 'random', 'print', 'randomize', '{'])\n\n/** Tokens the transition around the text continues with (`if A do ...`, `if A go to ...`). */\nconst CONTEXT = new Set(['do', 'go', 'abort', 'join', 'to', 'if', 'Pr=', 'nondeterministic'])\n\n/** At most this many tokens are looked at (the prefix search parses every prefix). */\nconst LIMIT = 80\n\nconst noViable = (text: string, t: Token | undefined) => `no viable alternative at input '${t ? text.slice(t.start, t.end) : 'go'}'`\n\nconst ARITHMETIC = new Set(['+', '-', '*', '/', '%'])\nconst LOGICAL = new Set(['&', '|', '^', '&&', '||', '==', '!=', '<', '<=', '>', '>='])\nconst VALUE_END = new Set(['ID', 'INT', 'FLOAT', 'BOOLEAN', 'STRING', ')', ']'])\nconst LITERAL = new Set(['ID', 'INT', 'FLOAT', 'BOOLEAN'])\n\nconst reads = (text: string, as: 'expression' | 'effect') => !parseStandalone(text, as).diagnostics.some(d => d.severity === 'error')\n\n/** KIELER's message for the first syntax error of `text` read as `as`, when the shape is one whose message is known. */\nexport function kielerSyntaxWording(text: string, as: 'expression' | 'effect'): string | undefined {\n const toks = lex(text).tokens.filter(t => t.kind !== 'EOF')\n if (!toks.length || toks.length > LIMIT || toks.some(t => t.kind === 'ANY_OTHER')) return undefined\n // The longest prefix that is a whole expression (effect): where KIELER's reading ends.\n let p = 0\n for (let n = toks.length - 1; n >= 1; n--) {\n if (reads(text.slice(0, toks[n - 1].end), as)) { p = n; break }\n }\n return afterPrefix(text, as, toks, p) ?? recovered(text, as, toks, p)\n}\n\n/** The first rules (fitted on 920 texts): what KIELER says about the token after the prefix that reads. */\nfunction afterPrefix(text: string, as: 'expression' | 'effect', toks: Token[], p: number): string | undefined {\n const next = toks[p]\n if (p === 0) {\n if (!next || OPERAND.has(next.kind)) return undefined\n return noViable(text, next)\n }\n // Words that go on the transition around the text: what KIELER says next depends on that transition.\n if (!next || CONTEXT.has(next.kind)) return undefined\n // `!a + b`: `!` takes one value, so KIELER stops at the operator, but only if what follows it reads.\n if ((toks[0].kind === '!' || toks[0].kind === '~') && BINARY.has(next.kind)) {\n const rest = parseStandalone(text.slice(next.end), 'expression')\n if (rest.diagnostics.some(d => d.severity === 'error')) return undefined\n }\n let depth = 0\n let binary = 0\n let comparisons = 0\n let assign: Token | undefined\n let ternary = 0\n for (const [i, t] of toks.slice(0, p).entries()) {\n if (t.kind === '(' || t.kind === '[') depth++\n else if (t.kind === ')' || t.kind === ']') depth--\n else if (depth > 0) continue\n else if (t.kind === '?' || t.kind === ':') {\n // Only a whole `c ? a : b` at the end of what was read (KIELER's three atoms).\n if (t.kind === ':' && i === p - 2 && toks[i - 2]?.kind === '?') ternary++\n else if (!(t.kind === '?' && i === p - 4 && toks[p - 2]?.kind === ':')) return undefined\n } else if (t.kind === ';' || t.kind === ',') return undefined\n else if (ASSIGN.has(t.kind)) assign ??= t\n else if (BINARY.has(t.kind)) { binary++; if (COMPARISON.has(t.kind)) comparisons++ }\n }\n if (depth !== 0 || next.kind === '[' || next.kind === ';') return undefined\n if (ternary) return binary === 0 && !assign === (as === 'expression') && (next.kind === '?' || next.kind === ':') ? noViable(text, next) : undefined\n // A comparison chain: `a < b < c` stops at the second comparison; a stray `)` after a whole expression.\n if (binary === 1 && comparisons === 1 && COMPARISON.has(next.kind)) return noViable(text, next)\n if (next.kind === ')') return noViable(text, next)\n if (as === 'expression') return binary === 0 ? noViable(text, next) : undefined\n if (binary > 0) return undefined\n // `x = 1 +`: the right-hand side goes on but breaks further on; KIELER names the assignment operator.\n if (assign && (BINARY.has(next.kind) || next.kind === '?')) return undefined\n return noViable(text, next)\n}\n\n/**\n * The second rules (fitted on the texts the first leave open, checked on 1500 more): ANTLR's single-token recovery\n * at the start (`print x`, `pre - (a)`), one unclosed parenthesis, and the decision KIELER backtracks to for an\n * index, a stray value or a call after a whole expression.\n */\nfunction recovered(text: string, as: 'expression' | 'effect', toks: Token[], p: number): string | undefined {\n const first = toks[0]\n const second = toks[1]\n // `print x` (an effect) and `pre - (a)` (an expression): a missing `(` is inserted before a value, an extra\n // token before `(` is skipped.\n if (((first.kind === 'print' && as === 'effect') || (first.kind === 'pre' && as === 'expression')) && second && second.kind !== '(' && second.kind !== '()') {\n if (toks[2]?.kind === '(') return `extraneous input '${text.slice(second.start, second.end)}' expecting '('`\n if (OPERAND.has(second.kind)) return `missing '(' at '${text.slice(second.start, second.end)}'`\n return undefined\n }\n // A prefix operator (or, in an expression, `(`) followed by something that cannot start a value.\n if ((first.kind === '(' || (as === 'expression' && (first.kind === '!' || first.kind === '~' || first.kind === '-'))) && second && !OPERAND.has(second.kind)) {\n return noViable(text, second)\n }\n // `(a + b` and `print(x`: one parenthesis left open where the text starts; KIELER finds `go` in its place.\n let depth = 0\n let outer = -1\n for (const [i, t] of toks.entries()) {\n if (t.kind === '(') { if (depth === 0) outer = i; depth++ } else if (t.kind === ')') depth--\n if (depth < 0) break\n }\n if (depth === 1 && (outer === 0 || (outer === 1 && first.kind === 'print')) && reads(text + ')', as)) return \"missing ')' at 'go'\"\n if (p === 0) return undefined\n\n const next = toks[p]\n const ops = operatorsBefore(toks, p)\n // `a[` after a lone value: KIELER names the bracket.\n if (as === 'expression' && next.kind === '[') return ops.length === 0 && !['-', '!', '~'].includes(first.kind) ? noViable(text, next) : undefined\n // A value right after a whole expression (`a b`, `x = 1 2`): KIELER names it, unless arithmetic or a\n // conditional came first (it may then backtrack to those).\n if (LITERAL.has(next.kind)) return ops.some(o => ARITHMETIC.has(o.kind) || o.kind === '?' || o.kind === ':') ? undefined : noViable(text, next)\n // A call after a whole expression (`b | f ( / x )`): after a comparison or a logical operator KIELER names the\n // `(`; after `?` the `?`; after arithmetic the first operator of that arithmetic.\n if (next.kind === '(') {\n const binary = ops.filter(o => !ASSIGN.has(o.kind))\n const last = binary.at(-1)\n if (!last) return undefined\n if (last.kind === '?') return noViable(text, last)\n // Inside a conditional KIELER may backtrack to its `?`.\n if (binary.some(o => o.kind === '?' || o.kind === ':')) return undefined\n if (LOGICAL.has(last.kind)) return noViable(text, next)\n if (ARITHMETIC.has(last.kind)) {\n let i = binary.length - 1\n while (i > 0 && ARITHMETIC.has(binary[i - 1].kind)) i--\n return noViable(text, binary[i])\n }\n }\n return undefined\n}\n\n/** The binary and assignment operators outside brackets in toks[0, p) (prefix `-`, `!` and `~` left out). */\nfunction operatorsBefore(toks: Token[], p: number): Token[] {\n const out: Token[] = []\n let depth = 0\n for (let i = 0; i < p; i++) {\n const t = toks[i]\n if (t.kind === '(' || t.kind === '[') depth++\n else if (t.kind === ')' || t.kind === ']') depth--\n else if (depth === 0) {\n const prefix = ['-', '!', '~'].includes(t.kind) && !VALUE_END.has(toks[i - 1]?.kind ?? '')\n if (!prefix && (ASSIGN.has(t.kind) || ARITHMETIC.has(t.kind) || LOGICAL.has(t.kind) || ['?', ':', '<<', '>>', '>>>', '->', 'fby', 'sfby'].includes(t.kind))) out.push(t)\n }\n }\n return out\n}\n"]}
|