X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.ts;h=60e74871dc96261bf3ddcb2eb4d3b332952f8f57;hb=fed01e9044149985b3df74a9225ce68805b8f478;hp=a8d103b5d550e29e63fe0e707a9b36b3b10bd090;hpb=6f2e788329da7702ea96dc28ae04499917ec8152;p=clo

diff --git a/src/index.ts b/src/index.ts
index a8d103b..60e7487 100644
--- a/src/index.ts
+++ b/src/index.ts
@@ -1,120 +1,190 @@
 var fs = require('fs');
-import { argv } from 'node:process';
-import * as tk from './tokenize.js';
+import jsTokens from "js-tokens";
 import * as util from 'util';
 
 /**
- * token tree type.
+ * 
+ * # REPRESENTATION
  */
-type tkTree = tk.Token[] | tk.Token
-
-export interface TokenMatcheePair {
-    matched: tkTree[]
-    remained: tk.Token[]
-}
-
 /**
- * @description
- * match one token type.
- * 
- * it returns a function which test if the type of first token of the `remained` part of
- *  the argument of the function is `typ` , if it's true, update the `TokenMatcheePair` wrapped
- * in `Some`. Otherwise, it returns `None`.
- *  * @param typ : the type to be test.
- * @returns the updated `TokenMatcheePair` wrapped in `Some(x)` or `None`.
+ * convert a `tkTree` AST to S-expr string
+ * @param t the `tkTree`
+ * @returns S-expr String
  */
-export function m1TType(typ: tk.TokenType):
-    (m: TokenMatcheePair) => tk.Maybe<TokenMatcheePair> {
-    return (m: TokenMatcheePair) => {
-        if (m.remained.length == 0) {
-            return { _tag: "None" };
-        }
-        /**
-         * token to be matched
-         * */
-        const ttbm = m.remained[0];
-        
-        if (ttbm.type == typ) {
-            m.matched.push(ttbm);
-            return {
-                _tag: "Some", value: {
-                    matched: m.matched,
-                    remained: m.remained.slice(1)
-                }
-            };
-        }
-        else {
-            return { _tag: "None" };
+export function tkTreeToSExp(t: tkTree): string{
+    var str = "";
+
+    if (Array.isArray(t)){
+        let strArray = t.map((x)=>tkTreeToSExp(x));
+        str = "(" + strArray.join(" ") + ")";
+    }else{
+        if (t=== undefined){
+            str = "%undefined"
+        }else{
+            str = t.value;
         }
     }
-};
 
-let toSome = tk.toSome;
-let thenDo = tk.thenDo;
-let orDo = tk.orDo;
+    return str;
+}
 
+/**inspect the inner of the representation. */
+let repr = (x : any)=>{return util.inspect(x, {depth: null})};
+/**
+ * 
+ * # TYPES
+ */
 
-argv.forEach((val, index) => {
-    console.log(`${index}=${val}`);
-});
+/**
+ * TokenPair for tokens' parser combinator
+ *
+ * matched: the matched (now and before) tokens
+ * 
+ * remained: tokens to be matched
+ * 
+ * ast: abstract syntax tree
+ */
+export interface TokenPair {
+    matched: jsTokens.Token[]
+    remained: jsTokens.Token[]
+    ast : tkTree[]
+}
+export type Some<T> = { _tag: "Some"; value: T };
+export type None = { _tag: "None" };
+export type Maybe<T> = Some<T> | None;
 
-let commandInput = argv[2];
-let commandInputTokenized = tk.tokenize(commandInput);
-console.log(commandInputTokenized);
+type Token = jsTokens.Token;
+type tkTree = Token | tkTree[];
 
 /**
- * matchee pair of commandInputTokenized
+ * 
+ * # PARSER UNITS
  */
-let commandTPair : TokenMatcheePair = {matched:[],
-                                remained: commandInputTokenized};
-
+function toSome<T>(x:T): Maybe<T>{
+    return {_tag: "Some", value: x};
+}
 
-let tInt = m1TType(tk.TokenType.INT);
-let tFlo = m1TType(tk.TokenType.FLO);
-let tStr = m1TType(tk.TokenType.STR);
-function tBool (x : TokenMatcheePair) :tk.Maybe<TokenMatcheePair> {
-    let text = x.remained[0].text
-    if (text == "true" || text == "false"){
-        return thenDo(toSome(x), m1TType(tk.TokenType.ID));
+/**
+ * like `m ==> f` in ocaml
+ * @param m matchee wrapped
+ * @param f matching function
+ * @returns wrapped result
+ */
+function thenDo(m : Maybe<TokenPair>, f : Function){
+    if (m._tag == "None"){
+        return m;
     }else{
-        return {_tag : "None"};
+        var a : Maybe<TokenPair> = f(m.value);
+        if (a._tag == "Some"){
+            a.value.ast = m.value.ast.concat(a.value.ast);
+        }
+
+        return a;
     }
 }
-
 /**
- * define the right hand side of a grammar
- * eg. `LHS ::= a + b`
- * @param process  the right hand side processing : eg. `a + b` in `LHS`
- * @param arrange define the order (0 starting) of the elements of the result.
- * ast. : eg. `a + c` is `1 0 2` `(+ a c)`
- * @returns the processed ast. 
+ * 
+ * @param m : the `TokenPair` to be consumed.
+ * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 token
+ *  and wraps it in `Some`,
+ * otherwise, returns `None`.
  */
-function gramRHS (process: Function, arrange : number[]){
-    return (m : TokenMatcheePair)=>{
-
-    let result : tk.Maybe<TokenMatcheePair> = process(m);
-    console.log(`result ${result}`)
-    if (result._tag == "None"){
-        return result;
+export function matchAny(m: TokenPair): Maybe<TokenPair> {
+    if (m.remained.length >= 1) {
+        return {
+            _tag: "Some", value: {
+                matched: m.matched.concat(m.remained[0]),
+                remained: m.remained.slice(1),
+                ast :  [m.remained[0]],
+            }
+        };
+    } else {
+        return { _tag: "None" };
     }
-    else{
-        let matched = result.value.matched;
-        let return_array : tkTree[] = Array(arrange.length);
+}
 
-        arrange.forEach((val, index) => {
-            return_array[arrange[index]] = matched[index];
-        });
+/**
+ * like `f1 | f2` in regex
+ * @param f1 the first tried function
+ * @param f2 the second tried function
+ * @returns wrapped result
+ */
+function orDo(f1 : Function, f2 : Function){
+    return (x : TokenPair) =>{
+        let res1 : Maybe<TokenPair> = f1(x);
+        if (res1._tag == "Some"){
+            return res1;
+        }else{
+            let res2 : Maybe<TokenPair> = f2(x);
+            return res2;
+        }
+    } 
+}
 
-        return return_array;
-    }
-    }
+/**
+ * like regex [^c]
+ * @param f input token function. one token only.
+ * @returns combined finction
+ */
+function notDo(f : Function){
+    return (x : TokenPair) =>{
+        let res1 : Maybe<TokenPair> = f(x);
+        if (res1._tag == "Some"){
+            return {_tag:"None"};
+        }else{
+            let res2 = matchAny(x);
+            return res2;
+        }
+    } 
 }
 
+function matchToken(typeName : string, value? : string):
+ (t : TokenPair) => Maybe<TokenPair>{
+    return (t)=>{
+        let headToken = t.remained[0];
+        if (headToken.type != typeName){
+            return {_tag:"None"};
+        }else{
+            if (value === undefined || value == headToken.value){
+                let newTokenPair = {
+                    matched: t.matched.concat(headToken),
+                    remained: t.remained.slice(1),
+                    ast : [headToken]
+                };
+                return {_tag : "Some", value : newTokenPair};
+            }else{
+                return {_tag:"None"};
+            }
+        };
+    }
+};
+
+
 /**
- *  CONST ::= INT | STR | FLO | BOOL
+ * 
+ * # TEST
  */
-var constParser = gramRHS((x : TokenMatcheePair)=>
-    {return thenDo(toSome(x),orDo(orDo(orDo(tInt,tFlo),tStr),tBool))}, [0]);
+const tokens = Array.from(jsTokens(
+`import foo from\t 'bar';
+import * as util  from 'util';
+
+
+花非花，霧\\{非霧 。{{foo();}}下
+一句`));
 
-let tree = constParser(commandTPair);
-console.log(util.inspect(tree, { showHidden: true, depth: null })); 
+console.log("RESULT="+repr(tokens));
+
+
+var mainTokenPair : TokenPair = {
+    matched : [] ,
+    remained : tokens,
+    ast : []};
+
+let a = thenDo(thenDo(toSome(mainTokenPair), matchToken('IdentifierName')),
+        notDo(matchToken('Punctuator', ';')));
+
+
+console.log("RESULT="+repr(a));
+if (a._tag == "Some"){
+    console.log("SEXP="+tkTreeToSExp(a.value.ast));
+}