FoxInterpreter.Mod 45 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539
  1. MODULE FoxInterpreter; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Scanner := FoxScanner, FoxParser, SyntaxTree := FoxSyntaxTree, Printout := FoxPrintout, Commands, Diagnostics, StringPool, InterpreterSymbols := FoxInterpreterSymbols, D:= Debugging,
  3. Strings, Streams, Modules, PersistentObjects, Basic := FoxBasic, SYSTEM, Machine, Global := FoxGlobal, Heaps;
  4. CONST
  5. EnableTrace = FALSE;
  6. MaxIndex = 8;
  7. TYPE
  8. Result*= InterpreterSymbols.Result;
  9. Value*=InterpreterSymbols.Value;
  10. Integer*=InterpreterSymbols.IntegerValue;
  11. Real*=InterpreterSymbols.RealValue;
  12. String*=InterpreterSymbols.StringValue;
  13. Boolean*=InterpreterSymbols.BooleanValue;
  14. Set*=InterpreterSymbols.SetValue;
  15. Range*=InterpreterSymbols.RangeValue;
  16. Char*=InterpreterSymbols.CharValue;
  17. Any*=InterpreterSymbols.AnyValue;
  18. MathArrayValue*= InterpreterSymbols.MathArrayValue;
  19. Scope*=InterpreterSymbols.Scope;
  20. Container*= InterpreterSymbols.Container;
  21. Builtin*=OBJECT (InterpreterSymbols.Object)
  22. VAR id: LONGINT;
  23. END Builtin;
  24. Item*= RECORD
  25. object*: InterpreterSymbols.Item;
  26. in*: InterpreterSymbols.Item;
  27. name*: StringPool.Index;
  28. i*: ARRAY MaxIndex OF LONGINT; (* indices if applicable *)
  29. END;
  30. CommandStatement = OBJECT (SyntaxTree.Statement)
  31. VAR command: Strings.String;
  32. PROCEDURE & InitCommandStatement(s: Strings.String);
  33. BEGIN
  34. command := s
  35. END InitCommandStatement;
  36. END CommandStatement;
  37. Parser*= OBJECT(FoxParser.Parser)
  38. PROCEDURE Statement(statements: SyntaxTree.StatementSequence; outer: SyntaxTree.Statement): BOOLEAN;
  39. VAR statement: SyntaxTree.Statement;
  40. BEGIN
  41. IF (symbol.token = Scanner.Identifier) & (symbol.identifier = StringPool.GetIndex1("CMD")) THEN
  42. statement := Cmd();
  43. statements.AddStatement(statement);
  44. RETURN TRUE
  45. (*
  46. ELSIF (symbol.token = Scanner.Identifier) & (symbol.identifier = StringPool.GetIndex1("CMDS")) THEN
  47. REPEAT
  48. statement := Cmd();
  49. statements.AddStatement(statement);
  50. UNTIL (symbol.token = Scanner.Identifier) & (symbol.identifier = StringPool.GetIndex1("ENDCMDS"))
  51. *)
  52. ELSE
  53. RETURN Statement^(statements, outer);
  54. END;
  55. END Statement;
  56. PROCEDURE Cmd(): SyntaxTree.Statement;
  57. VAR cmd: CommandStatement; string: Strings.String;
  58. BEGIN
  59. NextSymbol;
  60. IF MandatoryString(string) THEN
  61. NEW(cmd, string);
  62. (* TRACE(string^) *)
  63. END;
  64. RETURN cmd;
  65. END Cmd;
  66. END Parser;
  67. Interpreter* = OBJECT (SyntaxTree.Visitor)
  68. VAR
  69. value: BOOLEAN;
  70. item-: Item;
  71. module-: Modules.Module;
  72. typeDesc-: Modules.TypeDesc;
  73. procedureDesc-: Modules.ProcedureEntry;
  74. scope-: Scope;
  75. exit: BOOLEAN;
  76. error-: BOOLEAN;
  77. diagnostics: Diagnostics.Diagnostics;
  78. context-: Commands.Context;
  79. PROCEDURE & Init*(scope: Scope; diagnostics: Diagnostics.Diagnostics; context: Commands.Context);
  80. BEGIN
  81. IF scope = NIL THEN scope := global END;
  82. SELF.scope := scope;
  83. error := FALSE;
  84. SELF.diagnostics := diagnostics;
  85. SELF.context := context;
  86. END Init;
  87. PROCEDURE SetScope*(s: Scope);
  88. BEGIN
  89. scope := s
  90. END SetScope;
  91. PROCEDURE Reset*;
  92. BEGIN
  93. error := FALSE;
  94. END Reset;
  95. PROCEDURE Error(CONST msg: ARRAY OF CHAR);
  96. BEGIN
  97. IF error THEN RETURN END;
  98. (*! use diagnostics *)
  99. error := TRUE;
  100. IF diagnostics # NIL THEN
  101. diagnostics.Error("",Diagnostics.Invalid, Diagnostics.Invalid, msg);
  102. END;
  103. END Error;
  104. PROCEDURE ErrorSS(CONST msg: ARRAY OF CHAR; id: StringPool.Index);
  105. VAR name: ARRAY 128 OF CHAR; message: ARRAY 256 OF CHAR;
  106. BEGIN
  107. IF error THEN RETURN END;
  108. (*! use diagnostics *)
  109. error := TRUE;
  110. COPY(msg, message);
  111. IF id # 0 THEN Strings.Append(message," "); StringPool.GetString(id, name); Strings.Append(message, name); END;
  112. IF diagnostics # NIL THEN
  113. diagnostics.Error("",Diagnostics.Invalid, Diagnostics.Invalid, message);
  114. END;
  115. END ErrorSS;
  116. (** syntax tree types omitted -- unused *)
  117. (** expressions *)
  118. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  119. VAR s: SET; i: LONGINT; value: Value;
  120. BEGIN
  121. FOR i := 0 TO x.elements.Length()-1 DO
  122. IF GetValue(x.elements.GetExpression(i), value) THEN
  123. IF value IS Integer THEN INCL(s, LONGINT(value(Integer).value))
  124. ELSIF value IS Range THEN s := s + {FIRST(value(Range).value)..LAST(value(Range).value)}
  125. ELSE Error("wrong value type")
  126. END;
  127. END;
  128. END;
  129. NewSet(s)
  130. END VisitSet;
  131. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  132. VAR numberElements, i: LONGINT; a: MathArrayValue;
  133. BEGIN
  134. numberElements := x.elements.Length();
  135. NEW(a, numberElements);
  136. FOR i := 0 TO numberElements-1 DO
  137. Expression(x.elements.GetExpression(i));
  138. a.SetValue(i,item.object(Value));
  139. END;
  140. item.object := a; value := TRUE;
  141. END VisitMathArrayExpression;
  142. PROCEDURE NewInt(i: HUGEINT);
  143. VAR v: Integer;
  144. BEGIN
  145. NEW(v, i); item.object := v; value := TRUE
  146. END NewInt;
  147. PROCEDURE NewReal(i: LONGREAL);
  148. VAR v: Real;
  149. BEGIN
  150. NEW(v, i); item.object := v; value := TRUE
  151. END NewReal;
  152. PROCEDURE NewBool(b: BOOLEAN);
  153. VAR v: Boolean;
  154. BEGIN
  155. NEW(v, b); item.object := v; value := TRUE;
  156. END NewBool;
  157. PROCEDURE NewSet(s: SET);
  158. VAR v: Set;
  159. BEGIN
  160. NEW(v, s); item.object := v; value := TRUE;
  161. END NewSet;
  162. PROCEDURE NewString(CONST s: ARRAY OF CHAR);
  163. VAR v: String;
  164. BEGIN
  165. NEW(v, s); item.object := v; value := TRUE;
  166. END NewString;
  167. PROCEDURE NewRange(r: RANGE);
  168. VAR v: Range;
  169. BEGIN
  170. NEW(v, r ); item.object := v; value := TRUE;
  171. END NewRange;
  172. PROCEDURE NewChar(c: CHAR);
  173. VAR v: Char;
  174. BEGIN
  175. NEW(v, c); item.object := v; value := TRUE;
  176. END NewChar;
  177. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  178. VAR value: Value; i: HUGEINT; r: LONGREAL; b: BOOLEAN; operator: LONGINT;
  179. BEGIN
  180. operator := x.operator;
  181. IF ~GetValue(x, value) THEN RETURN END;
  182. IF value IS Integer THEN
  183. i := value(Integer).value;
  184. CASE operator OF
  185. Scanner.Minus: NewInt(-i)
  186. |Scanner.Plus: NewInt(i)
  187. ELSE Error("unary operator not supported")
  188. END;
  189. ELSIF value IS Real THEN
  190. r := value(Real).value;
  191. CASE operator OF
  192. Scanner.Minus: NewReal(-r)
  193. |Scanner.Plus: NewReal(r)
  194. ELSE Error("unary operator not supported")
  195. END;
  196. ELSIF value IS Boolean THEN
  197. b := value(Boolean).value;
  198. CASE operator OF
  199. Scanner.Not: NewBool(~b)
  200. ELSE Error("unary operator not supported")
  201. END;
  202. ELSIF value IS Set THEN
  203. CASE operator OF
  204. Scanner.Minus: NewSet(-value(Set).value)
  205. ELSE Error("unary operator not supported")
  206. END;
  207. ELSE
  208. Error("unary operation not supported");
  209. END;
  210. END VisitUnaryExpression;
  211. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  212. VAR left, right: Value; operator: LONGINT; li, ri: HUGEINT; lr, rr: LONGREAL; lb, rb: BOOLEAN; sl, sr: SET;
  213. BEGIN
  214. operator := x.operator;
  215. IF ~GetValue(x.left, left) OR ~GetValue(x.right, right) THEN RETURN END;
  216. IF (left IS Integer) & (right IS Integer) THEN
  217. li := left(Integer).value; ri := right(Integer).value;
  218. CASE operator OF
  219. |Scanner.Plus: NewInt(li+ri)
  220. |Scanner.Minus: NewInt(li-ri);
  221. |Scanner.Times: NewInt(li * ri);
  222. |Scanner.Div: NewInt(li DIV ri);
  223. |Scanner.Mod: NewInt(li MOD ri);
  224. |Scanner.Equal: NewBool(li = ri);
  225. |Scanner.Unequal: NewBool(li # ri)
  226. |Scanner.Less: NewBool(li < ri)
  227. |Scanner.LessEqual: NewBool(li <= ri)
  228. |Scanner.Greater: NewBool(li > ri)
  229. |Scanner.GreaterEqual: NewBool(li >= ri)
  230. |Scanner.Slash: NewReal(li/ri)
  231. ELSE Error("binary operator not supported")
  232. END;
  233. ELSIF ((left IS Integer) OR (left IS Real)) & ((right IS Integer) OR (right IS Real)) THEN
  234. IF left IS Integer THEN lr := left(Integer).value
  235. ELSE lr := left(Real).value
  236. END;
  237. IF right IS Integer THEN rr := right(Integer).value;
  238. ELSE rr := right(Real).value
  239. END;
  240. CASE operator OF
  241. |Scanner.Plus: NewReal(lr+rr)
  242. |Scanner.Minus: NewReal(lr-rr);
  243. |Scanner.Times: NewReal(lr * rr);
  244. |Scanner.Slash: NewReal(lr / rr);
  245. |Scanner.Equal: NewBool(lr = rr);
  246. |Scanner.Unequal: NewBool(lr # rr)
  247. |Scanner.Less: NewBool(lr < rr)
  248. |Scanner.LessEqual: NewBool(lr <= rr)
  249. |Scanner.Greater: NewBool(lr > rr)
  250. |Scanner.GreaterEqual: NewBool(lr >= rr)
  251. ELSE Error("binary operator not supported")
  252. END;
  253. ELSIF (left IS Boolean) & (right IS Boolean) THEN
  254. lb := left(Boolean).value; rb := right(Boolean).value;
  255. CASE operator OF
  256. |Scanner.Or: NewBool(lb OR rb);
  257. |Scanner.And: NewBool(lb & rb);
  258. |Scanner.Equal: NewBool(lb = rb)
  259. |Scanner.Unequal: NewBool(lb # rb)
  260. ELSE Error("operator not supported")
  261. END;
  262. ELSIF (left IS String) & (right IS String) THEN
  263. CASE operator OF
  264. |Scanner.Equal: NewBool(left(String).value^ = right(String).value^);
  265. |Scanner.Unequal: NewBool(left(String).value^ = right(String).value^);
  266. |Scanner.Less: NewBool(left(String).value^ < right(String).value^);
  267. |Scanner.LessEqual: NewBool(left(String).value^ <= right(String).value^);
  268. |Scanner.Greater: NewBool(left(String).value^ > right(String).value^);
  269. |Scanner.GreaterEqual: NewBool(left(String).value^ >= right(String).value^);
  270. ELSE Error("binary operator not supported")
  271. END
  272. ELSIF (left IS Set) & (right IS Set) THEN
  273. sl := left(Set).value; sr := right(Set).value;
  274. CASE operator OF
  275. |Scanner.Plus: NewSet(sl+sr)
  276. |Scanner.Minus: NewSet(sl-sr);
  277. |Scanner.Times: NewSet(sl * sr);
  278. |Scanner.Slash: NewSet(sl / sr);
  279. |Scanner.Equal: NewBool(sl = sr);
  280. |Scanner.Unequal: NewBool(sl # sr)
  281. |Scanner.Less: NewBool(sl < sr)
  282. |Scanner.LessEqual: NewBool(sl <= sr)
  283. |Scanner.Greater: NewBool(sl > sr)
  284. |Scanner.GreaterEqual: NewBool(sl >= sr)
  285. ELSE Error("binary operator not supported")
  286. END;
  287. ELSIF (left IS Integer) & (right IS Set) THEN
  288. CASE operator OF
  289. Scanner.In: NewBool(left(Integer).value IN right(Set).value)
  290. ELSE Error("binary operator not supported")
  291. END;
  292. ELSE
  293. Error("binary operation not supported");
  294. Printout.Info("binary operation", x);
  295. END;
  296. END VisitBinaryExpression;
  297. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  298. VAR first,last,step: HUGEINT; value: Integer;
  299. BEGIN
  300. IF ~ExpectInteger(x.first, value) THEN RETURN END;
  301. first := value.value;
  302. IF ~ExpectInteger(x.last, value) THEN RETURN END;
  303. last := value.value;
  304. IF (x.step # NIL) & ExpectInteger(x.step, value) THEN
  305. step := value.value;
  306. ELSE
  307. step := 1
  308. END;
  309. NewRange(first ..last BY step);
  310. END VisitRangeExpression;
  311. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  312. BEGIN HALT(100) (* abstract *) END VisitTensorRangeExpression;
  313. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  314. BEGIN HALT(100) (* abstract *) END VisitConversion;
  315. (** designators (expressions) *)
  316. PROCEDURE VisitDesignator*(x: SyntaxTree.Designator);
  317. BEGIN HALT(100) (* abstract *) END VisitDesignator;
  318. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  319. VAR moduleName, name: Modules.Name;
  320. BEGIN
  321. IF x.qualifiedIdentifier.prefix # SyntaxTree.invalidIdentifier THEN
  322. item.name := x.qualifiedIdentifier.prefix;
  323. item.object := scope.FindObject1(item.name, -1, item.in);
  324. IF item.object = NIL THEN
  325. StringPool.GetString(item.name, moduleName);
  326. item.object :=InterpreterSymbols.GetModule(moduleName);
  327. END;
  328. END;
  329. item.name := x.qualifiedIdentifier.suffix;
  330. IF (item.object # NIL) THEN
  331. IF item.object IS Result THEN
  332. StringPool.GetString(item.name, name);
  333. item.object := item.object(Result).Find(name);
  334. ELSE
  335. item.in := item.object;
  336. item.object := InterpreterSymbols.FindInObject1(item.object, item.name,-1);
  337. END;
  338. ELSE
  339. ErrorSS("invalid selector",item.name);
  340. item.in := NIL;
  341. END;
  342. END VisitQualifiedType;
  343. (*
  344. PROCEDURE FindInScope(scope: Scope; symbol: StringPool.Index): Value;
  345. VAR item: Value;
  346. BEGIN
  347. REPEAT
  348. item := scope.Find1(symbol);
  349. IF (item = NIL) THEN
  350. scope := scope.outer
  351. ELSE
  352. scope := NIL
  353. END;
  354. UNTIL (scope = NIL);
  355. RETURN item
  356. END FindInScope;
  357. *)
  358. (*
  359. PROCEDURE FindType(CONST types: POINTER TO ARRAY OF Modules.TypeDesc; CONST name: ARRAY OF CHAR): Modules.TypeDesc;
  360. VAR i: LONGINT;
  361. BEGIN
  362. IF types = NIL THEN RETURN NIL END;
  363. FOR i := 0 TO LEN(types)-1 DO
  364. IF types[i].name = name THEN
  365. RETURN types[i];
  366. END;
  367. END;
  368. RETURN NIL;
  369. END FindType;
  370. PROCEDURE FindProc(CONST types: POINTER TO ARRAY OF Modules.ProcedureEntry; CONST name: ARRAY OF CHAR; VAR num: LONGINT): BOOLEAN;
  371. BEGIN
  372. IF types = NIL THEN RETURN FALSE END;
  373. FOR num := 0 TO LEN(types)-1 DO
  374. IF types[num].name^ = name THEN
  375. RETURN TRUE;
  376. END;
  377. END;
  378. RETURN FALSE;
  379. END FindProc;
  380. PROCEDURE FindField(CONST types: POINTER TO ARRAY OF Modules.FieldEntry; CONST name: ARRAY OF CHAR; VAR num: LONGINT): BOOLEAN;
  381. BEGIN
  382. IF types = NIL THEN RETURN FALSE END;
  383. FOR num := 0 TO LEN(types)-1 DO
  384. IF types[num].name^ = name THEN
  385. RETURN TRUE;
  386. END;
  387. END;
  388. RETURN FALSE;
  389. END FindField;
  390. *)
  391. PROCEDURE VisitIdentifierDesignator*(x: SyntaxTree.IdentifierDesignator);
  392. VAR moduleName: Modules.Name; msg: ARRAY 128 OF CHAR; res: LONGINT;
  393. builtin : Builtin; anyValue: Any;
  394. BEGIN
  395. ASSERT(x.left = NIL);
  396. item.name := x.identifier;
  397. (*
  398. item.object := FindInScope(item.scope, item.name);
  399. *)
  400. IF item.name = Basic.MakeString("trace") THEN
  401. NEW(builtin); builtin.id := Global.systemTrace;
  402. item.object := builtin;
  403. ELSIF item.name = Basic.MakeString("context") THEN
  404. NEW(anyValue, context);
  405. item.object := anyValue;
  406. ELSE
  407. item.object := scope.FindObject1(item.name, -1, item.in);
  408. IF item.object = NIL THEN
  409. StringPool.GetString(item.name, moduleName);
  410. item.object :=InterpreterSymbols.GetModule(moduleName);
  411. END;
  412. END;
  413. END VisitIdentifierDesignator;
  414. PROCEDURE VisitSelectorDesignator*(x: SyntaxTree.SelectorDesignator);
  415. VAR traverse: BOOLEAN; name: ARRAY 128 OF CHAR; num: LONGINT;
  416. BEGIN
  417. Expression(x.left); traverse := FALSE;
  418. IF error THEN RETURN END;
  419. item.name := x.identifier;
  420. IF (item.object # NIL) THEN
  421. IF item.object IS Result THEN
  422. StringPool.GetString(item.name, name);
  423. item.object := item.object(Result).Find(name);
  424. ELSE
  425. item.in := item.object;
  426. item.object := InterpreterSymbols.FindInObject1(item.object, x.identifier,-1);
  427. END;
  428. ELSE
  429. ErrorSS("invalid selector",item.name);
  430. item.in := NIL;
  431. END;
  432. END VisitSelectorDesignator;
  433. PROCEDURE VisitParameterDesignator*(x: SyntaxTree.ParameterDesignator);
  434. VAR e: SyntaxTree.Expression; proc: InterpreterSymbols.ProcedureResult; i: LONGINT;
  435. adr: ADDRESS; adrValue: Value; any: InterpreterSymbols.AnyValue;
  436. BEGIN
  437. e := x.left;
  438. Expression(e);
  439. IF (item.object # NIL) THEN
  440. IF (item.object IS InterpreterSymbols.ProcedureResult) THEN
  441. proc := item.object(InterpreterSymbols.ProcedureResult);
  442. (* self pointer *)
  443. proc.Pars();
  444. IF ~(proc.caller IS InterpreterSymbols.ModuleResult) THEN
  445. adrValue := proc.caller.Evaluate();
  446. ASSERT(adrValue.GetAddress(adr));
  447. proc.PushAddress(adr);
  448. END;
  449. (* result pointer *)
  450. IF proc.ReturnsPointer() THEN
  451. NEW(any,NIL);
  452. proc.PushAddress(any.Address());
  453. END;
  454. FOR i := 0 TO x.parameters.Length()-1 DO
  455. e := x.parameters.GetExpression(i);
  456. IF ~proc.Push(Designate(e)) THEN Error("wrong parameter"); RETURN END;
  457. END;
  458. IF ~proc.Check() THEN Error("non-matching parameter number"); RETURN END;
  459. item.object := proc.Evaluate();
  460. IF any # NIL THEN item.object := any END;
  461. ELSIF (item.object IS Builtin) THEN
  462. CASE item.object(Builtin).id OF
  463. Global.systemTrace:
  464. SystemTrace(x.parameters);
  465. ELSE
  466. Error("no builtin?")
  467. END;
  468. ELSE
  469. Error("no procedure")
  470. END;
  471. ELSE
  472. Error("no procedure")
  473. END;
  474. END VisitParameterDesignator;
  475. PROCEDURE VisitArrowDesignator*(x: SyntaxTree.ArrowDesignator);
  476. BEGIN HALT(100) (* abstract *) END VisitArrowDesignator;
  477. PROCEDURE VisitBracketDesignator*(x: SyntaxTree.BracketDesignator);
  478. VAR array: MathArrayValue; i: LONGINT; element: Value; index: Integer; obj: PersistentObjects.Object;
  479. leftValue, rightValue: Value; filter: InterpreterSymbols.ObjectFilter; expression: SyntaxTree.Expression;
  480. attribute, value: ARRAY 128 OF CHAR; val: LONGINT;
  481. BEGIN
  482. Expression(x.left);
  483. IF (item.object # NIL) & (item.object IS MathArrayValue) THEN
  484. element := item.object(MathArrayValue);
  485. FOR i := 0 TO x.parameters.Length()-1 DO
  486. array := element(MathArrayValue);
  487. IF GetInteger(x.parameters.GetExpression(i), index) THEN
  488. element := array.GetValue(LONGINT(index.value));
  489. END;
  490. END;
  491. item.object := element;
  492. ELSIF (item.object # NIL) THEN
  493. NEW(filter); obj := item.object;
  494. FOR i := 0 TO x.parameters.Length()-1 DO
  495. expression := x.parameters.GetExpression(i);
  496. IF (expression IS SyntaxTree.BinaryExpression) & (expression(SyntaxTree.BinaryExpression).operator = Scanner.Equal) THEN
  497. IF (expression(SyntaxTree.BinaryExpression).left IS SyntaxTree.IdentifierDesignator) &
  498. GetValue(expression(SyntaxTree.BinaryExpression).right, rightValue) THEN
  499. StringPool.GetString(
  500. expression(SyntaxTree.BinaryExpression).left(SyntaxTree.IdentifierDesignator).identifier, attribute);
  501. rightValue(Value).GetString(value);
  502. obj := filter.Filter(obj, attribute, value)
  503. ELSE HALT(200)
  504. END;
  505. ELSE
  506. IF GetValue(expression, leftValue) THEN
  507. IF leftValue IS String THEN
  508. leftValue(Value).GetString(value);
  509. obj := filter.Filter(obj, "name", value);
  510. ELSIF leftValue IS Integer THEN
  511. IF obj IS PersistentObjects.ObjectList THEN
  512. item.object := obj(PersistentObjects.ObjectList).GetElement(LONGINT(leftValue(Integer).value))
  513. ELSIF obj IS Container THEN
  514. item.object := obj(Container).GetItem(LONGINT(leftValue(Integer).value))
  515. ELSE Error("cannot be indexed")
  516. END;
  517. END;
  518. END;
  519. END;
  520. END;
  521. IF obj(Container).symbols.Length() > 0 THEN
  522. item.object := obj(Container).GetItem(0);
  523. ELSE
  524. Error("no such symbol")
  525. END;
  526. END;
  527. END VisitBracketDesignator;
  528. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  529. BEGIN HALT(100) (* abstract *) END VisitSymbolDesignator;
  530. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  531. BEGIN HALT(100) (* abstract *) END VisitIndexDesignator;
  532. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  533. BEGIN HALT(100)
  534. END VisitProcedureCallDesignator;
  535. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList);
  536. VAR
  537. printout: Printout.Printer;
  538. value: Value;
  539. expression: SyntaxTree.Expression;
  540. i: LONGINT;
  541. out: Streams.Writer;
  542. BEGIN
  543. out := context.out;
  544. printout := Printout.NewPrinter(out,Printout.SourceCode,FALSE);
  545. FOR i := 0 TO x.Length()-1 DO
  546. expression := x.GetExpression(i);
  547. IF ~(expression IS SyntaxTree.StringValue) THEN
  548. printout.Expression(expression);
  549. out.String("= ");
  550. END;
  551. value := Evaluate(expression);
  552. IF value # NIL THEN
  553. value.WriteValue(out);
  554. ELSE
  555. out.String("UNKNOWN")
  556. END;
  557. out.Ln;
  558. END;
  559. out.Update;
  560. END SystemTrace;
  561. PROCEDURE FindType(type: SyntaxTree.Type): Result;
  562. BEGIN
  563. type.Accept(SELF);
  564. IF item.object # NIL THEN
  565. RETURN item.object(Result);
  566. END;
  567. RETURN NIL;
  568. END FindType;
  569. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  570. VAR p,p0,p1,p2: SyntaxTree.Expression;
  571. type,t0,t1,t2: SyntaxTree.Type;
  572. len: LONGINT;
  573. i: LONGINT;
  574. parameter: SyntaxTree.Parameter;
  575. name: Basic.SectionName;
  576. modifier: SyntaxTree.Modifier;
  577. position: LONGINT;
  578. value: Value;
  579. result: Result;
  580. address: ADDRESS;
  581. o: ANY;
  582. anyValue: InterpreterSymbols.AnyValue;
  583. proc: InterpreterSymbols.ProcedureResult;
  584. ignore: Result;
  585. e: SyntaxTree.Expression;
  586. BEGIN
  587. position := x.position;
  588. p0 := NIL; p1 := NIL; p2 := NIL;
  589. IF x.parameters # NIL THEN
  590. len := x.parameters.Length();
  591. ELSE
  592. len := 0
  593. END;
  594. CASE x.id OF
  595. (* ----- NEW -----*)
  596. Global.New:
  597. result := FindType(x.returnType);
  598. IF (result # NIL) & (result IS InterpreterSymbols.TypeResult) THEN
  599. address := result.Address();
  600. Heaps.NewRec(o, address, FALSE);
  601. NEW(anyValue, o);
  602. proc := result(InterpreterSymbols.TypeResult).Constructor();
  603. IF proc # NIL THEN
  604. proc.Pars();
  605. proc.PushAddress(o);
  606. FOR i := 0 TO x.parameters.Length()-1 DO
  607. e := x.parameters.GetExpression(i);
  608. IF ~proc.Push(Designate(e)) THEN Error("wrong parameter"); item.object := NIL; RETURN END;
  609. END;
  610. IF ~proc.Check() THEN Error("non-matching parameter number"); item.object := NIL; RETURN END;
  611. ignore := proc.Evaluate();
  612. END;
  613. item.object := anyValue;
  614. ELSE
  615. Error("No Type");
  616. END;
  617. |Global.systemTrace:
  618. SystemTrace(x.parameters);
  619. ELSE (* function not yet implemented *)
  620. Error("Not Yet Implemented");
  621. END;
  622. END VisitBuiltinCallDesignator;
  623. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  624. BEGIN HALT(100) (* abstract *) END VisitTypeGuardDesignator;
  625. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  626. BEGIN HALT(100) (* abstract *) END VisitDereferenceDesignator;
  627. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  628. BEGIN HALT(100) (* abstract *) END VisitSupercallDesignator;
  629. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  630. BEGIN HALT(100) (* abstract *) END VisitSelfDesignator;
  631. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  632. BEGIN HALT(100) (* abstract *) END VisitResultDesignator;
  633. (** values *)
  634. PROCEDURE VisitValue*(x: SyntaxTree.Value);
  635. BEGIN HALT(100) (* abstract *) END VisitValue;
  636. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  637. BEGIN
  638. NewBool(x.value)
  639. END VisitBooleanValue;
  640. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  641. BEGIN
  642. NewInt(x.value)
  643. END VisitIntegerValue;
  644. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  645. BEGIN
  646. NewChar(x.value);
  647. END VisitCharacterValue;
  648. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  649. BEGIN
  650. NewSet(x.value)
  651. END VisitSetValue;
  652. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  653. BEGIN HALT(100) (* abstract *) END VisitMathArrayValue;
  654. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  655. BEGIN
  656. NewReal(x.value)
  657. END VisitRealValue;
  658. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  659. BEGIN HALT(100) (* abstract *) END VisitComplexValue;
  660. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  661. BEGIN
  662. NewString(x.value^);
  663. END VisitStringValue;
  664. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  665. BEGIN HALT(100) (* abstract *) END VisitNilValue;
  666. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  667. BEGIN HALT(100) (* abstract *) END VisitEnumerationValue;
  668. (** symbols *)
  669. PROCEDURE VisitSymbol*(x: SyntaxTree.Symbol);
  670. BEGIN HALT(100) (* abstract *) END VisitSymbol;
  671. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  672. BEGIN HALT(100) (* abstract *) END VisitTypeDeclaration;
  673. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  674. BEGIN HALT(100) (* abstract *) END VisitConstant;
  675. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  676. BEGIN HALT(100) (* abstract *) END VisitVariable;
  677. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  678. BEGIN HALT(100) (* abstract *) END VisitParameter;
  679. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  680. BEGIN HALT(100) (* abstract *) END VisitProcedure;
  681. PROCEDURE VisitBuiltin*(x: SyntaxTree.Builtin);
  682. BEGIN HALT(100) (* abstract *) END VisitBuiltin;
  683. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  684. BEGIN HALT(100) (* abstract *) END VisitOperator;
  685. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  686. BEGIN HALT(100) (* abstract *) END VisitImport;
  687. (* copy src to value string replacing substrings that are embraced between refSymbols by expression value *)
  688. PROCEDURE TranslateString*(cmd: CHAR; CONST str: ARRAY OF CHAR; VAR dest: Strings.String): BOOLEAN;
  689. CONST
  690. LeftDelimiter = '{'; RightDelimiter = '}';
  691. VAR
  692. position : LONGINT; ch: CHAR;
  693. destination, expMaker: Scanner.StringMaker; destinationWriter, expressionWriter: Streams.Writer; scanner: Scanner.Scanner; parser: Parser;
  694. expression: SyntaxTree.Expression; value: Value; len: LONGINT;
  695. comment: LONGINT;
  696. PROCEDURE Next(VAR ch: CHAR);
  697. BEGIN
  698. IF position = LEN(str) THEN ch := 0X ELSE ch := str[position]; INC(position) END;
  699. END Next;
  700. PROCEDURE EvaluateExpression();
  701. VAR str: Strings.String; reader: Streams.Reader; done: BOOLEAN;
  702. BEGIN
  703. reader := expMaker.GetReader();
  704. NEW(scanner, "", reader, 0, NIL);
  705. NEW(parser, scanner, NIL);
  706. REPEAT
  707. error := FALSE;
  708. expression := parser.Expression();
  709. done := GetValue(expression, value);
  710. UNTIL done OR ~parser.Optional(Scanner.Colon);
  711. IF done THEN value(Value).WriteValue(destinationWriter);
  712. ELSE
  713. destinationWriter.String("#COULD NOT INTERPRETE#");
  714. error := TRUE;
  715. END;
  716. END EvaluateExpression;
  717. BEGIN
  718. error := FALSE;
  719. position := 0;
  720. Next(ch);
  721. NEW(destination,256); destinationWriter := destination.GetWriter();
  722. NEW(expMaker, 256); expressionWriter := expMaker.GetWriter();
  723. comment := 0;
  724. WHILE (ch # 0X) DO
  725. (* copy string literally *)
  726. IF (comment = 0) & (ch = cmd) THEN
  727. Next(ch);
  728. IF ch = LeftDelimiter THEN
  729. Next(ch);
  730. REPEAT
  731. WHILE (ch # 0X) & (ch # RightDelimiter) DO expressionWriter.Char(ch); Next(ch) END;
  732. IF ch = RightDelimiter THEN
  733. Next(ch); IF (ch # cmd) THEN expressionWriter.Char(RightDelimiter) END;
  734. END;
  735. UNTIL (ch=0X) OR (ch = cmd);
  736. IF ch # 0X THEN Next(ch) END;
  737. expressionWriter.Update;
  738. EvaluateExpression();
  739. expMaker.Clear;
  740. ELSE
  741. destinationWriter.Char(cmd);
  742. END;
  743. (* remove comments *)
  744. ELSIF ch = "(" THEN
  745. Next(ch);
  746. IF ch = "*" THEN
  747. INC(comment); Next(ch);
  748. ELSIF comment = 0 THEN
  749. destinationWriter.Char("(");
  750. END;
  751. ELSIF ch="*" THEN
  752. Next(ch);
  753. IF ch = ")" THEN
  754. DEC(comment);
  755. IF comment < 0 THEN comment := 0 END; Next(ch);
  756. ELSIF comment = 0 THEN
  757. destinationWriter.Char("*")
  758. END;
  759. ELSE
  760. IF comment = 0 THEN destinationWriter.Char(ch) END;
  761. Next(ch);
  762. END;
  763. END;
  764. destinationWriter.Update;
  765. dest := destination.GetString(len);
  766. RETURN ~error
  767. END TranslateString;
  768. PROCEDURE VisitCommandStatement(x: CommandStatement);
  769. VAR t: Strings.String; res: LONGINT; msg: ARRAY 128 OF CHAR; i: LONGINT; array: Strings.StringArray; pos: LONGINT;
  770. command: ARRAY 256 OF CHAR; context: Commands.Context;
  771. PROCEDURE CreateContext(paramString : Strings.String; pos: LONGINT) : Commands.Context;
  772. VAR c : Commands.Context; arg : Streams.StringReader; dummy : ARRAY 1 OF CHAR; len: LONGINT;
  773. BEGIN
  774. IF (paramString = NIL) THEN
  775. NEW(arg, 1); dummy := ""; arg.SetRaw(dummy, 0, 1);
  776. ELSE
  777. len := Strings.Length(paramString^)+1 (*+1 to include 0X *);
  778. NEW(arg, len-pos); arg.SetRaw(paramString^, pos, len-pos);
  779. END;
  780. NEW(c, context.in, arg, context.out, context.error, context.caller);
  781. RETURN c;
  782. END CreateContext;
  783. PROCEDURE IsDelimiter(ch : CHAR) : BOOLEAN;
  784. CONST CR = 0DX; LF = 0AX; TAB = 9X;
  785. BEGIN
  786. RETURN (ch = " ") OR (ch = CR) OR (ch = LF) OR (ch = TAB) OR (ch = ";") OR (ch = 0X);
  787. END IsDelimiter;
  788. BEGIN
  789. IF SELF.context = NIL THEN
  790. context := Commands.GetContext();
  791. ELSE
  792. context := SELF.context
  793. END;
  794. IF TranslateString("?", x.command^, t) THEN END;
  795. array := Strings.Split(t^, "~");
  796. FOR i := 0 TO LEN(array)-1 DO
  797. Strings.TrimWS(array[i]^);
  798. IF (array[i]^ # "") THEN
  799. (* extract command *)
  800. pos := 0;
  801. WHILE ~IsDelimiter(array[i][pos]) DO command[pos] := array[i][pos]; INC(pos); END;
  802. command[pos] := 0X;
  803. IF pos # 0 THEN
  804. context := CreateContext(array[i], pos);
  805. Commands.Activate(command, context, {Commands.Wait, Commands.InheritContext}, res, msg);
  806. IF res # 0 THEN
  807. context.out.String("Interpreter: "); context.error.String(command); context.error.String(" failed"); context.error.Ln
  808. END;
  809. END;
  810. END;
  811. END;
  812. IF res # 0 THEN Error(msg) END;
  813. END VisitCommandStatement;
  814. (** statements *)
  815. PROCEDURE VisitStatement*(x: SyntaxTree.Statement);
  816. BEGIN
  817. IF x IS CommandStatement THEN
  818. VisitCommandStatement(x(CommandStatement));
  819. ELSE HALT(100)
  820. END;
  821. END VisitStatement;
  822. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  823. VAR call: SyntaxTree.Designator;
  824. BEGIN
  825. IF ~(x.call IS SyntaxTree.ParameterDesignator) THEN
  826. call := SyntaxTree.NewParameterDesignator(x.position,x.call,SyntaxTree.NewExpressionList());
  827. ELSE
  828. call := x.call;
  829. END;
  830. call.Accept(SELF);
  831. END VisitProcedureCallStatement;
  832. PROCEDURE LoadValue;
  833. BEGIN
  834. IF (item.object # NIL) & (item.object IS Result) THEN
  835. item.object := item.object(Result).Evaluate();
  836. ELSE
  837. ErrorSS("could not load value", item.name);
  838. END;
  839. END LoadValue;
  840. PROCEDURE GetValue*(x: SyntaxTree.Expression; VAR w: Value): BOOLEAN;
  841. BEGIN
  842. IF error THEN RETURN FALSE END;
  843. Expression(x);
  844. IF error THEN RETURN FALSE END;
  845. LoadValue();
  846. IF item.object # NIL THEN
  847. w := item.object(Value);
  848. END;
  849. RETURN ~error
  850. END GetValue;
  851. PROCEDURE Designate(x: SyntaxTree.Expression): Result;
  852. BEGIN
  853. Expression(x);
  854. IF item.object # NIL THEN
  855. RETURN item.object(Result);
  856. ELSE
  857. RETURN NIL
  858. END;
  859. END Designate;
  860. PROCEDURE Evaluate(x: SyntaxTree.Expression): Value;
  861. VAR w: Value;
  862. BEGIN
  863. IF GetValue(x, w) THEN RETURN w ELSE RETURN NIL END;
  864. END Evaluate;
  865. PROCEDURE GetInteger(x: SyntaxTree.Expression; VAR i: Integer): BOOLEAN;
  866. VAR v: Value;
  867. BEGIN
  868. IF GetValue(x, v) & (v IS Integer) THEN i := v(Integer); RETURN TRUE ELSE RETURN FALSE END;
  869. END GetInteger;
  870. PROCEDURE ExpectInteger(x: SyntaxTree.Expression; VAR i: Integer): BOOLEAN;
  871. BEGIN IF ~GetInteger(x, i) THEN Error("invalid value - must be integer"); RETURN FALSE ELSE RETURN TRUE END;
  872. END ExpectInteger;
  873. PROCEDURE GetBoolean(x: SyntaxTree.Expression; VAR i: Boolean): BOOLEAN;
  874. VAR v: Value;
  875. BEGIN
  876. IF GetValue(x, v) & (v IS Boolean) THEN i := v(Boolean); RETURN TRUE ELSE RETURN FALSE END;
  877. END GetBoolean;
  878. PROCEDURE ExpectBoolean(x: SyntaxTree.Expression; VAR b: Boolean): BOOLEAN;
  879. BEGIN IF ~GetBoolean(x, b) THEN Error("invalid value - must be boolean"); RETURN FALSE ELSE RETURN TRUE END;
  880. END ExpectBoolean;
  881. PROCEDURE PutValue(x: SyntaxTree.Designator; v: Value);
  882. BEGIN
  883. x.Accept(SELF);
  884. IF (item.object # NIL) & item.object(Result).SetV(v) THEN
  885. ELSIF (item.in # NIL) & (item.name # 0) & (item.in IS Container) THEN
  886. item.in(Container).Enter1(v, item.name);
  887. END;
  888. END PutValue;
  889. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  890. VAR value: Value;
  891. BEGIN
  892. IF GetValue(x.right, value) THEN
  893. IF x.left # NIL THEN
  894. PutValue(x.left, value);
  895. END;
  896. END;
  897. END VisitAssignment;
  898. PROCEDURE IfPart(ifPart: SyntaxTree.IfPart): BOOLEAN;
  899. VAR value: Boolean;
  900. BEGIN
  901. IF ExpectBoolean(ifPart.condition,value) THEN
  902. IF value(Boolean).value THEN
  903. StatementSequence(ifPart.statements);
  904. RETURN TRUE
  905. END;
  906. END;
  907. RETURN FALSE
  908. END IfPart;
  909. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  910. VAR i: LONGINT; elsif: SyntaxTree.IfPart;
  911. BEGIN
  912. IF IfPart(x.ifPart) THEN RETURN END;
  913. FOR i := 0 TO x.ElsifParts()-1 DO
  914. elsif := x.GetElsifPart(i);
  915. IF IfPart(elsif) THEN RETURN END;
  916. END;
  917. IF x.elsePart # NIL THEN
  918. StatementSequence(x.elsePart)
  919. END;
  920. END VisitIfStatement;
  921. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  922. BEGIN HALT(100) (* abstract *) END VisitWithStatement;
  923. PROCEDURE CasePart(x: SyntaxTree.CasePart; b: SyntaxTree.BinaryExpression): BOOLEAN;
  924. VAR i: LONGINT; value: Value;
  925. BEGIN
  926. FOR i := 0 TO x.elements.Length()-1 DO
  927. b.SetRight(x.elements.GetExpression(i));
  928. IF GetValue(b, value) & (value IS Boolean) THEN
  929. IF value(Boolean).value THEN StatementSequence(x.statements); RETURN TRUE END;
  930. ELSE Error("invalid non-boolean value")
  931. END
  932. END;
  933. RETURN FALSE
  934. END CasePart;
  935. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  936. VAR binary: SyntaxTree.BinaryExpression; i: LONGINT;
  937. BEGIN
  938. binary := SyntaxTree.NewBinaryExpression(0, x.variable, x.variable, Scanner.Equal);
  939. FOR i := 0 TO x.CaseParts()-1 DO
  940. IF CasePart(x.GetCasePart(i), binary) THEN RETURN END;
  941. END;
  942. IF x.elsePart # NIL THEN
  943. StatementSequence(x.elsePart)
  944. END;
  945. END VisitCaseStatement;
  946. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  947. VAR value: Boolean;
  948. BEGIN
  949. WHILE ExpectBoolean(x.condition, value) & value.value DO
  950. StatementSequence(x.statements);
  951. END;
  952. END VisitWhileStatement;
  953. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  954. VAR value: Boolean;
  955. BEGIN
  956. REPEAT
  957. StatementSequence(x.statements);
  958. UNTIL ~ExpectBoolean(x.condition, value) OR value.value
  959. END VisitRepeatStatement;
  960. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  961. VAR fromV, toV, byV: Integer; from, to, by,i: HUGEINT; int: Integer;
  962. BEGIN
  963. IF ExpectInteger(x.from, fromV) & ExpectInteger(x.to, toV) THEN
  964. from := fromV.value;
  965. to := toV.value;
  966. Expression(x.variable);
  967. NEW(int, from);
  968. PutValue(x.variable, int);
  969. i := from;
  970. WHILE i <= to DO
  971. int.value := i;
  972. StatementSequence(x.statements);
  973. INC(i);
  974. END;
  975. END;
  976. END VisitForStatement;
  977. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  978. VAR prevExit: BOOLEAN;
  979. BEGIN
  980. prevExit := exit;
  981. exit := FALSE;
  982. LOOP
  983. StatementSequence(x.statements);
  984. IF exit THEN EXIT END;
  985. END;
  986. exit := prevExit
  987. END VisitLoopStatement;
  988. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  989. BEGIN
  990. exit := TRUE
  991. END VisitExitStatement;
  992. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  993. BEGIN HALT(100) (* abstract *) END VisitReturnStatement;
  994. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  995. BEGIN HALT(100) (* abstract *) END VisitAwaitStatement;
  996. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  997. BEGIN
  998. StatementSequence(x.statements)
  999. END VisitStatementBlock;
  1000. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  1001. BEGIN HALT(100) (* abstract *) END VisitCode;
  1002. PROCEDURE Expression(x: SyntaxTree.Expression);
  1003. BEGIN
  1004. value := FALSE;
  1005. x.Accept(SELF);
  1006. END Expression;
  1007. PROCEDURE Statement*(x: SyntaxTree.Statement);
  1008. BEGIN
  1009. item.object := NIL;
  1010. x.Accept(SELF);
  1011. END Statement;
  1012. PROCEDURE StatementSequence*(x: SyntaxTree.StatementSequence);
  1013. VAR i: LONGINT;
  1014. BEGIN
  1015. FOR i := 0 TO x.Length()-1 DO
  1016. Statement(x.GetStatement(i));
  1017. END;
  1018. END StatementSequence;
  1019. END Interpreter;
  1020. Resolver*= OBJECT
  1021. VAR
  1022. interpreter: Interpreter;
  1023. content: PersistentObjects.Content;
  1024. resolved: Basic.HashTable;
  1025. current: Scope;
  1026. changed: BOOLEAN;
  1027. PROCEDURE & InitResolver*;
  1028. BEGIN
  1029. NEW(content); NEW(resolved,64); NEW(interpreter, NIL, NIL, NIL);
  1030. END InitResolver;
  1031. PROCEDURE Traverse(CONST name: ARRAY OF CHAR; array: BOOLEAN);
  1032. VAR index: LONGINT; success: BOOLEAN;
  1033. BEGIN
  1034. IF array THEN index := 0 ELSE index := -1 END;
  1035. REPEAT
  1036. success := FALSE;
  1037. content.success := FALSE;
  1038. current.object.Get(name, index, content);
  1039. IF content.success & (content.class = PersistentObjects.Class.Object) THEN
  1040. success := content.object # NIL;
  1041. IF content.object # NIL THEN
  1042. DoResolve(current.Enter(content.object)); (* content object can be overwritten as sideeffect! *)
  1043. END;
  1044. END;
  1045. INC(index);
  1046. UNTIL ~array OR ~success
  1047. END Traverse;
  1048. PROCEDURE DoResolve*(scope: Scope);
  1049. VAR translation: PersistentObjects.Interpretation; prev: Scope; str: Strings.String;
  1050. BEGIN
  1051. IF (scope.object # NIL) & ~resolved.Has(scope.object) THEN
  1052. prev := current;
  1053. current := scope;
  1054. resolved.Put(scope.object, SELF);
  1055. interpreter.Init(scope, NIL, NIL);
  1056. translation := scope.object.firstTranslation;
  1057. WHILE translation # NIL DO
  1058. IF EnableTrace THEN D.String("resolve "); D.String(translation.name^); D.String(":"); D.String(translation.str^); END;
  1059. IF interpreter.TranslateString("?", translation.str^, str) THEN
  1060. IF EnableTrace THEN D.String(":"); D.Str(str^); END;
  1061. scope.object.Get(translation.name^, -1, content);
  1062. IF ~content.Equals(str^) THEN
  1063. changed := TRUE;
  1064. content.SetAsString(str^);
  1065. END;
  1066. scope.object.Set(translation.name^, -1, content);
  1067. ELSE
  1068. IF EnableTrace THEN D.String(":could not resolve"); END;
  1069. END;
  1070. IF EnableTrace THEN D.Ln; END;
  1071. translation := translation.next
  1072. END;
  1073. scope.object.Enumerate(Traverse);
  1074. current := prev;
  1075. END;
  1076. END DoResolve;
  1077. PROCEDURE Resolve*(scope: Scope);
  1078. BEGIN
  1079. REPEAT
  1080. changed := FALSE;
  1081. resolved.Clear();
  1082. DoResolve(scope);
  1083. UNTIL ~changed;
  1084. END Resolve;
  1085. END Resolver;
  1086. VAR global-: Scope;
  1087. PROCEDURE Statements*(context: Commands.Context);
  1088. VAR scanner: Scanner.Scanner; parser: Parser; diagnostics: Diagnostics.StreamDiagnostics;
  1089. seq: SyntaxTree.StatementSequence; interpreter: Interpreter;
  1090. BEGIN
  1091. NEW(diagnostics, context.error);
  1092. scanner := Scanner.NewScanner("",context.arg,0,diagnostics);
  1093. NEW(parser, scanner, diagnostics);
  1094. seq := parser.StatementSequence(NIL);
  1095. NEW(interpreter, global, diagnostics,context); interpreter.StatementSequence(seq);
  1096. END Statements;
  1097. PROCEDURE Expression*(context: Commands.Context);
  1098. VAR scanner: Scanner.Scanner; parser: Parser; diagnostics: Diagnostics.StreamDiagnostics;
  1099. interpreter: Interpreter; value: Value; expression: SyntaxTree.Expression;
  1100. BEGIN
  1101. NEW(diagnostics, context.error);
  1102. scanner := Scanner.NewScanner("",context.arg,0,diagnostics);
  1103. NEW(parser, scanner, diagnostics);
  1104. expression := parser.Expression();
  1105. NEW(interpreter, global, diagnostics,NIL);
  1106. IF interpreter.GetValue(expression, value) THEN
  1107. value(Value).WriteValue(context.out); context.out.Ln
  1108. ELSE
  1109. context.error.String("could not evaluate expression"); context.error.Ln
  1110. END;
  1111. END Expression;
  1112. PROCEDURE TranslateString*(context: Commands.Context);
  1113. VAR dest: Strings.String; testString: ARRAY 256 OF CHAR; interpreter: Interpreter; streamDiagnostics: Diagnostics.StreamDiagnostics;
  1114. BEGIN
  1115. NEW(streamDiagnostics, context.error);
  1116. NEW(interpreter, global, streamDiagnostics,NIL);
  1117. WHILE context.arg.GetString(testString) DO
  1118. IF interpreter.TranslateString("?", testString, dest) THEN
  1119. context.out.String("RESULT: ");
  1120. context.out.String(dest^);
  1121. context.out.Ln;
  1122. ELSE
  1123. context.error.String("could not translate: ");
  1124. context.error.String(dest^);
  1125. context.error.Ln;
  1126. END;
  1127. END;
  1128. END TranslateString;
  1129. PROCEDURE InitGlobalScope;
  1130. VAR container: Container;
  1131. BEGIN
  1132. NEW(container);
  1133. NEW(global, NIL, container);
  1134. END InitGlobalScope;
  1135. BEGIN
  1136. InitGlobalScope;
  1137. END FoxInterpreter.
  1138. SystemTools.Free FoxInterpreter FoxInterpreterSymbols ~
  1139. FoxInterpreter.Expression
  1140. Test.c.b;
  1141. ~
  1142. FoxInterpreter.Expression
  1143. Test.Test(5);
  1144. ~
  1145. FoxInterpreter.Statements
  1146. a := Test.c.b;
  1147. Test.c.b := Test.c.b + 1;
  1148. ~
  1149. FoxInterpreter.Expression
  1150. a;
  1151. ~
  1152. FoxInterpreter.Expression
  1153. Test.c.b;
  1154. ~
  1155. FoxInterpreter.Statements
  1156. Test.Test(123)
  1157. ~
  1158. FoxInterpreter.Statements
  1159. FOR i := 1 TO 100 DO
  1160. CASE i MOD 10 OF
  1161. 1: suffix := "st"
  1162. |2: suffix := "nd"
  1163. |3: suffix := "rd"
  1164. ELSE suffix := "th"
  1165. END;
  1166. IF i MOD 9 = 0 THEN
  1167. CMD SystemTools.Show This is the ?{i}?{suffix} run. ;
  1168. CMD SystemTools.Ln;
  1169. END;
  1170. END;
  1171. ~
  1172. FoxInterpreter.Expression
  1173. i MOD 10 ~
  1174. FoxInterpreter.Statements
  1175. o := Test.TestO();
  1176. ~
  1177. FoxInterpreter.Statements
  1178. s := {0..10, 15};
  1179. a := 10;
  1180. b := 10..20;
  1181. c := {a,b};
  1182. x := 10;
  1183. y := 20;
  1184. z := x;
  1185. z := x + y;
  1186. b := x = y;
  1187. nb := x # y;
  1188. FOR i := 0 TO 3 DO
  1189. a := i;
  1190. IF i<2 THEN
  1191. a := 200+i;
  1192. END;
  1193. CASE i OF
  1194. 0: a := 2000;
  1195. |2: HALT(100)
  1196. END;
  1197. END;
  1198. ~
  1199. TRACE(x);
  1200. FOR i := 0 TO 100 DO
  1201. x[i] := i
  1202. END;
  1203. ~
  1204. FoxInterpreter.TranslateString
  1205. "This is a string ?{15+2*20*a:32}? oha."
  1206. "The rest of this string will be evaluated ?{3+5 = 20}?"
  1207. "?{ 100*15"
  1208. "a set in a evaluated expression ?{{1,2,4}}?"
  1209. ~
  1210. FoxInterpreter.Statements
  1211. a := [[1,2,3],[4,5,6],[7,8,9]];
  1212. FOR i := 0 TO 2 DO
  1213. FOR j := 0 TO 2 DO
  1214. CMD \+"SystemTools.Show ?{a[i,j]}? ;"+\
  1215. END;
  1216. CMD \+"SystemTools.Ln;"+\
  1217. END;
  1218. CMD \+"SystemTools.Show ?{a}? "+\
  1219. ~
  1220. SystemTools.FreeDownTo FoxInterpreter FoxInterpreterSymbols ~
  1221. FoxInterpreter.Statements
  1222. version := 02000302H;
  1223. a := [
  1224. (* development , version base, TL300, CN, SingleSensor, Version *)
  1225. [FALSE, "TLxDev", FALSE, FALSE, FALSE, version],
  1226. [FALSE, "TL400", FALSE, FALSE, FALSE, version],
  1227. [FALSE, "TL300", TRUE, FALSE, TRUE, version],
  1228. [FALSE, "TL300CN", TRUE, TRUE, FALSE, version],
  1229. [FALSE, "TL300USsu", TRUE, FALSE, TRUE, version],
  1230. [FALSE, "TL300USrt", TRUE, FALSE, FALSE, version]
  1231. ];
  1232. FOR i := 0 TO 5 DO
  1233. major := a[i,5] DIV 1000000H MOD 100H;
  1234. minor := a[i,5] DIV 10000H MOD 100H;
  1235. release := a[i,5] DIV 100H MOD 100H;
  1236. internal := a[i,5] MOD 100H;
  1237. CMD \+"
  1238. SystemTools.Show Building ?{a[i,1]}? Version ?{major}?.?{minor}?.?{release}?.?{internal}? ~
  1239. SystemTools.Ln ~
  1240. FSTools.CreateFile -c -r TLHostConst.Mod
  1241. MODULE TLHostConst;
  1242. (**
  1243. purpose: GUI Configuration Controller. Sets basics for differentiation of different product lines.
  1244. author: Felix Friedrich
  1245. *)
  1246. CONST
  1247. Development*=?{a[i,0]}?;
  1248. VersionBase*="?{a[i,1]}? ";
  1249. TL300*=?{a[i,2]}?;
  1250. CN*=?{a[i,3]}?;
  1251. SingleSensor*=?{a[i,4]}?;
  1252. Version* = ?{a[i,5]}?;
  1253. END TLHostConst.
  1254. ~
  1255. Compiler.Compile --objectFile=Generic Runtime.Mod Trace.Mod A2/Win32.MiniKernel.Mod A2/Win32.WatchdogServer.Mod ~
  1256. StaticLinker.Link
  1257. --fileFormat=PE32
  1258. --fileName=A2Watchdog.exe
  1259. --extension=Gof
  1260. --displacement=401000H
  1261. Runtime Trace MiniKernel WatchdogServer ~
  1262. SystemTools.Show Create ramdisk and format with FAT file system... ~ SystemTools.Ln ~
  1263. VirtualDisks.InstallRamdisk RAMDISK 240000 ~
  1264. Partitions.WriteMBR RAMDISK#0 OBEMBR.Bin ~
  1265. Partitions.Create RAMDISK#1 12 1000 ~
  1266. Partitions.Format RAMDISK#1 FatFS ~
  1267. FSTools.Mount WINAOS FatFS RAMDISK#1 ~
  1268. SystemTools.Ln ~ SystemTools.Show Create WinAOS directory structure... ~
  1269. FSTools.CreateDirectory WINAOS:/TL ~
  1270. FSTools.CreateDirectory WINAOS:/TL/obj ~
  1271. FSTools.CreateDirectory WINAOS:/TL/source ~
  1272. FSTools.CreateDirectory WINAOS:/TL/data ~
  1273. FSTools.CreateDirectory WINAOS:/TL/skins ~
  1274. FSTools.CreateDirectory WINAOS:/TL/fonts ~
  1275. FSTools.CreateDirectory WINAOS:/TL/work ~
  1276. SystemTools.Show Done. ~ SystemTools.Ln ~
  1277. SystemTools.Ln ~ SystemTools.Show Create build directory and build WinAos... ~ SystemTools.Ln ~
  1278. Release.Build
  1279. -f=TL/TLHost.Tool --path="WINAOS:/TL/obj/" --build --zip WinAosMini ~
  1280. SystemTools.Ln ~ SystemTools.Show Extracting data ... ~ SystemTools.Ln ~
  1281. ZipTool.ExtractAll --prefix=WINAOS:/TL/data/ --sourcePath=WINAOS:/TL/obj/ --overwrite -d --silent
  1282. Kernel.zip System.zip Drivers.zip
  1283. ApplicationsMini.zip Compiler.zip GuiApplicationsMini.zip TL.zip
  1284. ~
  1285. SystemTools.Ln ~ SystemTools.Show Removing object files from data folder... ~ SystemTools.Ln ~
  1286. FSTools.DeleteFiles --silent WINAOS:/TL/data/*.Obw ~
  1287. SystemTools.Ln ~ SystemTools.Show Extracting fonts ... ~ SystemTools.Ln ~
  1288. ZipTool.ExtractAll --prefix=WINAOS:/TL/fonts/ --sourcePath=WINAOS:/TL/obj/ --overwrite -d --silent
  1289. ScreenFonts.zip TrueTypeFonts.zip
  1290. ~
  1291. SystemTools.Ln ~ SystemTools.Show Delete ZIP archives from obj folder... ~ SystemTools.Ln ~
  1292. FSTools.DeleteFiles --silent WINAOS:/TL/obj/*.zip ~
  1293. SystemTools.Ln ~ SystemTools.Show Copy skins ... ~ SystemTools.Ln ~
  1294. FSTools.CopyFiles -o ../../source/*.skin => WINAOS:/TL/skins/*.skin ~
  1295. SystemTools.Ln ~ SystemTools.Show Delete some large files that are not stricly required... ~ SystemTools.Ln ~
  1296. FSTools.DeleteFiles
  1297. WINAOS:/TL/data/UnicodeData.txt
  1298. WINAOS:/TL/data/Setup.Text
  1299. WINAOS:/TL/data/BootManager.Text
  1300. ~
  1301. SystemTools.Ln ~ SystemTools.Show Delete some files from data folder... ~ SystemTools.Ln ~
  1302. FSTools.DeleteFiles WINAOS:/TL/data/*.Bin ~
  1303. FSTools.DeleteFiles
  1304. WINAOS:/TL/data/TestContext.xml
  1305. WINAOS:/TL/data/Release.Auto.dsk
  1306. WINAOS:/TL/data/AosDefault.Pal
  1307. WINAOS:/TL/data/OBL.Text
  1308. WINAOS:/TL/data/License.Text
  1309. WINAOS:/TL/data/bluebottle.xsl
  1310. WINAOS:/TL/data/WMPerfMonAlerts.XML
  1311. WINAOS:/TL/data/config.txt
  1312. WINAOS:/TL/data/WMPerfMon.Text
  1313. WINAOS:/TL/obj/CompileCommand.Tool
  1314. ~
  1315. FSTools.CopyFiles WINAOS:/TL/data/ZeroSkin.zip => WINAOS:/TL/skins/ZeroSkin.zip ~
  1316. FSTools.CopyFiles A2Watchdog.exe => WINAOS:/TL/A2Watchdog.exe ~
  1317. FSTools.DeleteFiles WINAOS:/TL/data/ZeroSkin.zip ~
  1318. SystemTools.Show Linking aos.exe ... ~ SystemTools.Ln ~
  1319. PELinker.Link --path=WINAOS:/TL/obj/ --destination=WINAOS:/TL/tl.exe Win32.Aos.Link ~
  1320. FSTools.CreateFile -c -r WINAOS:/TL/aos.ini
  1321. [Configuration]
  1322. Paths.Search = work;obj;source;data;skins;fonts;c:/windows/fonts/
  1323. Paths.Work = work
  1324. Oberon = OberonExternal.Text
  1325. Boot = Traps.Install
  1326. Boot1 = FileTrapWriter.Install
  1327. Boot2 = Display.Install --fullscreen --bits16 --noMouseCursor
  1328. Boot3 = WindowManager.Install --noMouseCursor --bgColor=0F2EFFH
  1329. Boot4 = Clipboard.Install
  1330. Boot6 = HotKeys.Open
  1331. Boot7 = TLC.EnableTrace
  1332. Boot8 = TLC.SetClientTraceLog tltrace
  1333. Boot9 = TLHost.Boot
  1334. Trace = File
  1335. ~
  1336. FSTools.CreateFile -c -r WINAOS:/TL/TL.bat
  1337. A2Watchdog tl.exe
  1338. ~
  1339. FSTools.DeleteFiles TL.zip ~
  1340. SystemTools.Ln ~ SystemTools.Show Creating archive TL.zip... ~
  1341. FSTools.Enumerate -s WINAOS:/TL/*.*
  1342. ZipTool.Add --silent -r TL.zip <#filename#>
  1343. ~
  1344. FSTools.CloseFiles TL.zip ~
  1345. SystemTools.Show Done ~ SystemTools.Ln ~
  1346. FSTools.Unmount WINAOS ~
  1347. VirtualDisks.Uninstall RAMDISK ~
  1348. FSTools.CopyFiles -o TL.zip => ?{a[i,1]}?_?{major}?_?{minor}?_?{release}?_?{internal}?.zip ~
  1349. "+\;
  1350. END;
  1351. ~