git.kianting.info Git - clo/blob - src/index.ts

   1 var fs = require('fs');
   2 import { argv, resourceUsage } from 'node:process';
   3 import * as tk from './tokenize.js';
   4 import * as util from 'util';
   5 import { drawEllipsePath, reduceRotation } from 'pdf-lib';
   6 import { isAnyArrayBuffer, isTypedArray } from 'node:util/types';
   7 import { error } from 'node:console';
   8 import { isUndefined } from 'node:util';
   9
  10 /**
  11  * debug reprensenting
  12  */
  13 let repr = (x : any)=>{return util.inspect(x, {depth: null})};
  14
  15 /**
  16  * token tree type.
  17  */
  18 type tkTree = tkTree[] | tk.Token
  19
  20 /**
  21  * concated 2 `tkTree`s
  22  * @param x the array to be concated
  23  * @param y the item or array to ve concated
  24  * @returns concated tkTree array, or thrown error if can't be concated.
  25  */
  26 function concat(x: tkTree, y:tkTree): tkTree[] {
  27     if (Array.isArray(x)){
  28             return x.concat(y);
  29     }else{
  30         throw new Error("the tkTree can't be concated, because it's not an array.");
  31
  32     }
  33 }
  34
  35 function slice(x: tkTree, index?:number, end?:number): tkTree[] {
  36     if (Array.isArray(x)){
  37             return x.slice(index,end);
  38     }else{
  39         throw new Error("the tkTree can't be concated, because it's not an array.");
  40
  41     }
  42 }
  43
  44 /**
  45  * TokenMatcheePair for tokens' parser combinator
  46  *
  47  * matched: the matched (now and before) tokens
  48  *
  49  * remained: tokens to be matched
  50  *
  51  * ast: abstract syntax tree
  52  */
  53 export interface TokenMatcheePair {
  54     matched: tk.Token[]
  55     remained: tk.Token[]
  56     ast : tkTree[]
  57 }
  58
  59 /**
  60  * convert a `tkTree` AST to S-expr string
  61  * @param t the `tkTree`
  62  * @returns S-expr String
  63  */
  64 export function tkTreeToSExp(t: tkTree): string{
  65     var str = "";
  66
  67     if (Array.isArray(t)){
  68         let strArray = t.map((x)=>tkTreeToSExp(x));
  69         str = "(" + strArray.join(" ") + ")";
  70     }else{
  71         if (t=== undefined){
  72             str = "%undefined"
  73         }else{
  74             str = t.text;
  75         }
  76     }
  77
  78     return str;
  79 }
  80
  81 /**
  82  * @description
  83  * match one token type.
  84  *
  85  * it returns a function which test if the type of first token of the `remained` part of
  86  *  the argument of the function is `typ` , if it's true, update the `TokenMatcheePair` wrapped
  87  * in `Some`. Otherwise, it returns `None`.
  88  *  * @param typ : the type to be test.
  89  * @returns the updated `TokenMatcheePair` wrapped in `Some(x)` or `None`.
  90  */
  91 export function m1TType(typ: tk.TokenType):
  92     (m: TokenMatcheePair) => tk.Maybe<TokenMatcheePair> {
  93     return (m: TokenMatcheePair) => {
  94         if (m.remained.length == 0) {
  95             return { _tag: "None" };
  96         }
  97         /**
  98          * token to be matched
  99          * */
 100         const ttbm = m.remained[0];
 101
 102         if (ttbm.type == typ) {
 103             let new_matched = m.matched.concat(ttbm);
 104             let result : tk.Some<TokenMatcheePair> = {
 105                 _tag: "Some", value: {
 106                     matched: new_matched,
 107                     remained: m.remained.slice(1),
 108                     ast:  ([ttbm]),
 109                 }
 110             };
 111             return result;
 112         }
 113         else {
 114             return { _tag: "None" };
 115         }
 116     }
 117 };
 118
 119 /**
 120  * type int
 121  */
 122 let tInt  = m1TType(tk.TokenType.INT);
 123 let tId  = m1TType(tk.TokenType.ID);
 124
 125
 126 let tAdd  = m1TType(tk.TokenType.I_ADD);
 127 let tSub = m1TType(tk.TokenType.I_SUB);
 128 let tMul  = m1TType(tk.TokenType.I_MUL);
 129 let tDiv = m1TType(tk.TokenType.I_DIV);
 130 let tLParen = m1TType(tk.TokenType.L_PAREN);
 131 let tRParen = m1TType(tk.TokenType.R_PAREN);
 132
 133 let toSome = tk.toSome;
 134
 135
 136 argv.forEach((val, index) => {
 137     console.log(`${index}=${val}`);
 138 });
 139
 140
 141 /**
 142  * like `m ==> f` in ocaml
 143  * @param m matchee wrapped
 144  * @param f matching function
 145  * @returns wrapped result
 146  */
 147 function thenDo(m : tk.Maybe<TokenMatcheePair>, f : Function){
 148     if (m._tag == "None"){
 149         return m;
 150     }else{
 151         var a : tk.Maybe<TokenMatcheePair> = f(m.value);
 152         if (a._tag == "Some"){
 153             a.value.ast = concat(m.value.ast, a.value.ast);
 154         }
 155
 156         return a;
 157     }
 158 }
 159
 160 /**
 161  * like `f1 | f2` in regex
 162  * @param f1 the first tried function
 163  * @param f2 the second tried function
 164  * @returns wrapped result
 165  */
 166 function orDo(f1 : Function, f2 : Function){
 167     return (x : TokenMatcheePair) =>{
 168         let res1 : tk.Maybe<TokenMatcheePair> = f1(x);
 169         if (res1._tag == "Some"){
 170             return res1;
 171         }else{
 172             let res2 : tk.Maybe<TokenMatcheePair> = f2(x);
 173             return res2;
 174         }
 175     }
 176 }
 177
 178
 179 /**
 180  *
 181  * @param m : the `MatcheePair` to be consumed.
 182  * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 token
 183  *  and wraps it in `Some`,
 184  * otherwise, returns `None`.
 185  */
 186 export function matchAny(m: TokenMatcheePair): tk.Maybe<TokenMatcheePair> {
 187     if (m.remained.length >= 1) {
 188         return {
 189             _tag: "Some", value: {
 190                 matched: m.matched.concat(m.remained[0]),
 191                 remained: m.remained.slice(1),
 192                 ast :  [m.remained[0]],
 193             }
 194         };
 195     } else {
 196         return { _tag: "None" };
 197     }
 198 }
 199
 200 /**
 201  * Danger : Maybe it's not enough to work.
 202 * @description repeating matching function `f`
 203 * zero or more times, like the asterisk `*` in regex `f*` .
 204 * @param f : the function to be repeated 0+ times.
 205 * @returns:the combined function
 206 */
 207 export function OnceOrMoreDo(f: Function): (x: TokenMatcheePair) =>
 208     tk.Maybe<TokenMatcheePair> {
 209     return (x) => {
 210         var wrappedOldX: tk.Maybe<TokenMatcheePair> = { _tag: "Some", value: x };
 211         var wrappedNewX: tk.Maybe<TokenMatcheePair> = wrappedOldX;
 212
 213         var counter = -1;
 214
 215         while (wrappedNewX._tag != "None") {
 216             wrappedOldX = wrappedNewX;
 217             wrappedNewX = thenDo(wrappedOldX, f);
 218             counter += 1;
 219
 220         };
 221
 222
 223         if (counter <= 0){
 224             return { _tag: "None"};
 225         }
 226         let ast = wrappedOldX.value.ast ;
 227         wrappedOldX.value.ast =ast.slice(ast.length-counter);
 228         console.log(repr(wrappedOldX.value.ast));
 229
 230         return wrappedOldX; };
 231 }
 232
 233 /**
 234  * aux function for midfix operator
 235  * @param f function
 236  * @param signal the rule name
 237  * @returns
 238  */
 239 let midfix = (f : Function, signal? : string) => (x : TokenMatcheePair)=>{
 240     var a = f(x);
 241     if (a._tag == "Some"){
 242         let ast_tail : tkTree[] = slice(a.value.ast,a.value.ast.length-3);
 243         let new_ast = [ast_tail];
 244         a.value.ast = new_ast;
 245
 246         // console.log("+"+signal+"+"+repr(a));
 247
 248
 249     }
 250     return a;
 251 }
 252
 253 let circumfix = (f : Function, signal? : string) => (x : TokenMatcheePair)=>{
 254     var a = f(x);
 255     if (a._tag == "Some"){
 256         let inner = a.value.ast[a.value.ast.length-2];
 257         let ast_middle : tkTree[] = [inner];
 258         let new_ast = [ast_middle];
 259         a.value.ast = new_ast;
 260     }
 261     return a;
 262 }
 263
 264 /**
 265  * TODO: 12(13)(14) only parsed with only 12(13)
 266  */
 267 /** single1 = tInt | "(" expr ")"*/
 268 let single1 = circumfix((x : TokenMatcheePair) =>
 269     thenDo(thenDo(thenDo(tk.toSome(x), tLParen), expr), tRParen), "fac1");
 270 let single2= tInt;
 271 let single = orDo(single1, single2);
 272
 273 /** func = single | single "(" single ")"
 274  * i.e.
 275  *
 276  * func = single |  func_aux ( int )
 277  *
 278 */
 279
 280
 281 /** fac = single ["(" single ")"]?  | single
 282  * Issue1 to be fixed.
 283  */
 284 let fac1Appliee = circumfix((x  : TokenMatcheePair) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), tInt), tRParen), "fac1");
 285 let fac1 = (x : TokenMatcheePair) =>
 286     {
 287         let raw = thenDo(thenDo(toSome(x), single), OnceOrMoreDo(fac1Appliee));
 288
 289
 290
 291         if (raw._tag == "Some"){
 292
 293
 294             var result : tkTree  = raw.value.ast[0];
 295             let applyToken : tk.Token = {text: '%apply', ln:0, col:0};
 296             for (var i=1; i<raw.value.ast.length; i++){
 297                 result = [applyToken, result, raw.value.ast[i]];
 298             }
 299
 300             if (!Array.isArray(result)){
 301                 raw.value.ast = [result];
 302             }else{
 303                 raw.value.ast = result;
 304             }
 305         }
 306
 307
 308
 309
 310         return raw;
 311     };
 312 let fac2 = single;
 313 let fac = orDo(fac1, fac2);
 314
 315
 316
 317 /**
 318  *
 319  * term1 = fac (MUL | DIV) fac
 320  */
 321
 322 let term1 = midfix((x : TokenMatcheePair)=>
 323             thenDo(thenDo(thenDo(tk.toSome(x), fac), orDo(tMul,tDiv)), fac), "term1");
 324
 325
 326 /**
 327  *
 328  * term2 = int MUL int
 329  */
 330 let term2 = fac;
 331
 332 /**
 333  * term = term1 | term2
 334  */
 335 let term = orDo(term1, term2);
 336
 337
 338 /**
 339  *
 340  * expr1 = term ADD term
 341  */
 342 let expr1 = midfix((x : TokenMatcheePair)=>
 343                 thenDo(thenDo(thenDo(tk.toSome(x), term), orDo(tAdd,tSub)), term), "expr1");
 344 /**
 345  * expr2 = term
 346  */
 347 let expr2 = term;
 348
 349 /**
 350  * expr = expr1 | expr2
 351  */
 352 let expr = orDo(expr1, expr2);
 353
 354
 355
 356 let tokens = tk.tokenize("1");
 357 let tokens2 = tk.tokenize("1(2)");
 358 let tokens3 = tk.tokenize("1(2)(3)");
 359 let tokens4 = tk.tokenize("(3(2))*2+1");
 360
 361 //let tokens = tk.tokenize("(4-(3/4))");
 362 //tk.tokenize(argv[2]);
 363
 364 let tokensFiltered = tokens4.filter(
 365     (x)=>{return (x.type != tk.TokenType.NL
 366             && x.type != tk.TokenType.SP)});
 367
 368
 369
 370 let beta = expr({
 371         matched : [] ,
 372         remained : tokensFiltered,
 373         ast : []});
 374
 375 if (beta._tag == "Some"){
 376     console.log(tkTreeToSExp(beta.value.ast));
 377 }
 378
 379 console.log("RESULT="+repr(beta));
 380