X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.ts;h=48d2c866b1d5f622a965eb212194f267bb18722a;hb=ec563ca30f683cf8dcfd825c697913128f2a5445;hp=bcd3e10cc153cc9ee1495f29aaecce30401465ee;hpb=a722e739575012ebad8cd0a7d2c12df478a54eb8;p=clo

diff --git a/src/index.ts b/src/index.ts
index bcd3e10..48d2c86 100644
--- a/src/index.ts
+++ b/src/index.ts
@@ -1,252 +1,223 @@
 var fs = require('fs');
+import { argv, resourceUsage } from 'node:process';
+import * as tk from './tokenize.js';
+import * as util from 'util';
+import { reduceRotation } from 'pdf-lib';
 
-export type Some<T> = { _tag: "Some"; value: T };
-export type None = {_tag: "None"};
-
-
-/**
- * wrap a x in a `Some(T)`
- * @param x : variable to be wrapped.
- * @returns wrapped `x`.
- */
-function toSome<T>(x: T): Some<T>{
-    return  { _tag: "Some", value: x};  
-}
 /**
- * @description Like the `Some(a)` and `None` in Rust.
- *
- * @example
- * ```ts
- * let exam1 : Maybe<Number> = { _tag: "Some", value: 12 };
- * let exam2 : Maybe<Number> = None;
- * ```
+ * token tree type.
  */
-export type Maybe<T> = Some<T> | None;
+type tkTree = tkTree[] | tk.Token
 
+export interface TokenMatcheePair {
+    matched: tkTree[]
+    remained: tk.Token[]
+}
 
-/**
- * @description
- * the pair of the string to be matched later and the string that have been matched
- * @param matched : string have been matched
- * @param remained : string will be tested whether it'll be matched.
- */
-export type MatcheePair = {matched : string; remained : string};
+export interface MaybeTokensAST{
+    maybeTokens: tk.Maybe<TokenMatcheePair>;
+    ast: tkTree;
+}
 
 /**
  * @description
- * it returns a function which test if the first char of the `remained` part of
- *  the argument of the function is `c`, if it's true, update the `MatchedPair` wrapped
+ * 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 c : the char to be test.
- * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`.
+ *  * @param typ : the type to be test.
+ * @returns the updated `TokenMatcheePair` wrapped in `Some(x)` or `None`.
  */
-export function match1Char(c : string) : (m: MatcheePair) => Maybe<MatcheePair> {
-    return (m : MatcheePair)=>{
-        if (m.remained.length == 0){
+export function m1TType(typ: tk.TokenType):
+    (m: TokenMatcheePair) => tk.Maybe<TokenMatcheePair> {
+    return (m: TokenMatcheePair) => {
+        if (m.remained.length == 0) {
             return { _tag: "None" };
         }
-        const charToBeMatched = m.remained[0];
-        if (charToBeMatched === c){
-            return {_tag: "Some", value :{
-                    matched : m.matched + charToBeMatched,
-                    remained : m.remained.substring(1)}};
+        /**
+         * token to be matched
+         * */
+        const ttbm = m.remained[0];
+        
+        if (ttbm.type == typ) {
+            let new_matched = m.matched.concat(ttbm);
+            let result : tk.Some<TokenMatcheePair> = {
+                _tag: "Some", value: {
+                    matched: new_matched,
+                    remained: m.remained.slice(1)
+                }
+            };
+            return result;
         }
-        else{
-            return {_tag: "None"};
+        else {
+            return { _tag: "None" };
         }
     }
 };
 
+let toSome = tk.toSome;
+let thenDo = tk.thenDo;
+let zeroOrOnceDo = tk.zeroOrOnceDo;
+let orDo = tk.orDo;
+let zeroOrMoreDo = tk.zeroOrMoreDo;
+
+
+argv.forEach((val, index) => {
+    console.log(`${index}=${val}`);
+});
+
+let commandInput = "int a str b"//argv[2];
+let commandInputTokenized = tk.tokenize(commandInput);
+let commandInputTokenizedFiltered = commandInputTokenized.filter(
+    (x : tk.Token)=>{return x.type != tk.TokenType.SP &&
+                            x.type != tk.TokenType.NL});
+console.log("aaa: "+util.inspect(commandInputTokenizedFiltered, { showHidden: true, depth: null }));
+
 /**
- * 
- * @param m : the `MatcheePair` to be consumed.
- * @returns if the length of `m.remained` >= 1; consumes the matchee by 1 char and wraps it in `Some`,
- * otherwise, returns `None`.
+ * matchee pair of commandInputTokenized
  */
-export function matchAny(m : MatcheePair) : Maybe<MatcheePair>{
-    if (m.remained.length >= 1){
-        return {_tag: "Some", value :{
-            matched : m.matched + m.remained[0],
-            remained : m.remained.substring(1)}};
+let commandTPair : TokenMatcheePair = {matched:[],
+                                remained: commandInputTokenizedFiltered};
+
+
+let tInt = m1TType(tk.TokenType.INT);
+let tFlo = m1TType(tk.TokenType.FLO);
+let tStr = m1TType(tk.TokenType.STR);
+let tId = m1TType(tk.TokenType.ID);
+let tApos = m1TType(tk.TokenType.APOS);
+
+
+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));
     }else{
-        return {_tag: "None"};
+        return {_tag : "None"};
     }
 }
 
 /**
- * @description
- * it returns a function which test if the first char of the `remained` part of
- *  the argument of the function is between `l` and `u`, if it's true, update the `MatchedPair` wrapped
- * in `Some`. Otherwise, it returns `None`.
- *  * @param l : lower bound char, 1-char string
- *  * @param u : upper bound char, 1-char string
- * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`.
+ * 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. 
  */
-export function matchRange(l : string, u : string) : (m: MatcheePair) => Maybe<MatcheePair> {
-    let lCodepoint = charToCodepoint(l);
-    let uCodepoint = charToCodepoint(u);
-    if (l > u){
-        throw new Error("Error: the codepoint of `"+l+"` is not smaller than `"+u+"`)");
-    }
-    return (m : MatcheePair)=>{
-        if (m.remained.length < 1){
-            return {_tag : "None"};
-        }
-        const charToBeMatched = m.remained[0];
-        const codePointToBeMatched = charToCodepoint(charToBeMatched);
-        if (codePointToBeMatched >= lCodepoint && codePointToBeMatched <= uCodepoint){
-            return {_tag: "Some", value :{
-                    matched : m.matched + charToBeMatched,
-                    remained : m.remained.substring(1)}};
-        }
-        else{
-            return {_tag: "None"};
-        }
+function gramRHS (process: Function, arrange : number[]){
+    return (m : TokenMatcheePair)=>{
+
+    let middle : tk.Maybe<TokenMatcheePair> = process(m);
+
+    console.log("Middle"+util.inspect(middle, { showHidden: true, depth: null })); 
+
+    if (middle._tag == "None"){
+        return middle;
     }
-};
+    else{
+        let matched = middle.value.matched;
+        let arrLength = arrange.length;
+        let returnRrray : tkTree[] = Array(arrange.length);
+
+        arrange.forEach((val, index) => {
+            returnRrray[arrange[index]] = matched[index];
+        });
+
+        let matchedTmp1Length = matched.length-arrLength;
+        console.log(matchedTmp1Length);
+        var matchedTmp1 : tkTree[] = matched
+                                    .slice(0,matchedTmp1Length);
+        
+        console.log("matchedTmp1"+util.inspect(matchedTmp1, { showHidden: true, depth: null })); 
+        console.log("returnRrray"+util.inspect(returnRrray, { showHidden: true, depth: null })); 
+        matchedTmp1.push(returnRrray);
 
-/**
- * convert the one-char string to codepoint.
- * @param s : the string to code point.
- * @returns if `s.length > 1` return error; otherwise, return the codepoint of `s`.
- */
-export function charToCodepoint(s : string): number{
-    if (s.length > 1){
-        throw new Error("Error: the length of input string for "+s+ "is "+s.length+`,
-        however, it should be 1.`);
-    }else{
-        return s.charCodeAt(0);
+
+        let result : tk.Some<TokenMatcheePair> = {_tag:"Some",
+                    value : {matched : matchedTmp1,
+                             remained : middle.value.remained}};
+        return result;
+    }
     }
 }
 
 /**
- *  @description thendo(input, f, ...) like
- * a ==> f
- * @param input: the wrapped input. 
- * @param f: the function to be applied.
- * 
- * @returns:the applied wrapped result `MatcheePair`.
+ * typeABS ::= "'" ID
  */
-export function thenDo<T>(input : Maybe<T>, f : Function) : Maybe<T>{
-    if (input._tag == "None"){
-        return input;
-    }
-    else{
-        let inner = input.value;
-        return f(inner);
+var typeABS = (x : TokenMatcheePair)=>
+{
+    var result = thenDo(thenDo(toSome(x),tApos),tId);
+    if (result._tag == "Some" && "text" in result.value.matched[1]){
+        var realToken : tk.Token = result.value.matched[1];
+        realToken.text = "'"+realToken.text;
+        result.value.matched = [realToken];
     }
+    return result;
 }
 
 /**
- * @description "or", like the regex `( f1 | f2 )` . 
- * It returns a function `f` of which the argument is`x`.
- * if `f1(x)` is None, then `f` returns `f2(x)`. Otherwise, 
- * `F` returns `f1(x)`.
- * @param f1 : 1st function to be compared
- * @param f2 : 2nd function to be compared
- * @returns:the combined function
+ * TypeId ::=  typeABS | ID
  */
-export function orDo<T>(f1 : Function, f2: Function) : (x : T ) => Maybe<T>{
-    return (x) => {
-        let f1x : Maybe<T> = (f1(x));
-        {
-            if (f1x._tag == "None"){
-                return f2(x);
-            }
-            else{
-                return f1x;
-            }
-        }
-    };
+var typeName =  (x : TokenMatcheePair)=>
+{
+    return thenDo(toSome(x), orDo(typeABS, tId));
 }
 
+/**
+ *  CONST ::= INT | STR | FLO | BOOL
+ */
 
 /**
-* @description repeating matching function `f` 
-* zero or more times, like the asterisk `*` in regex `f*` . 
-* @param f : the function to be repeated 0+ times.
-* @returns:the combined function
-*/
-export function zeroOrMoreDo<T>(f : Function): (x : T) => Maybe<T>{
-    return (x)=>{
-        var wrapped_old_x : Maybe<T> = {_tag: "Some", value : x};
-        var wrapped_new_x : Maybe<T> = wrapped_old_x;
-
-        while (wrapped_new_x._tag != "None"){
-            wrapped_old_x = wrapped_new_x;
-            wrapped_new_x = thenDo(wrapped_old_x, f);
-        };
-
-        return wrapped_old_x;
-    };
-}
+ * TODO: 要用 debugger 檢查分析問題
+ */
+var constParser = gramRHS((x : TokenMatcheePair)=>
+    {return thenDo(toSome(x),orDo(orDo(orDo(tInt,tFlo),tStr),tBool))}, [0]);
 
 /**
-* @description Not. like the `^` inside regex of [^f].
-* returns a function `F(x)` such that if  `f(x)` is `None`,
-* returns the x consuming a char; if `f(x)` is not None, F(x)
-* returns `None`.
-* @param f: the function forbidden to be matched.
-* @returns: combined function `F`.
-*/
-export function notDo<T>(f : Function): (x : T) => Maybe<T>{
-    return (x)=>{
-        let wrapped_x : Maybe<T> = {
-            _tag : "Some",
-            value : x
-        };
-        let f_x = thenDo(wrapped_x, f);
-        
-        if (f_x._tag != "None"){
-            return {_tag:"None"};
-        }else{
-            return thenDo(wrapped_x, matchAny);
-        }
-    };
-}
+ * storing the tree
+ */
+var astTree : tkTree = [];
 
 /**
- * if `x` is matched by `f` once, returns `f(x)`. Otherwise, 
- * returns x
- * similar to `?` in regex `f?`.
- * @param f : the function to be matched
- * @returns return wrapped f(x)
+ * TYPE_PAIR ::= TYP_ID ID
  */
-export function zeroOrOnceDo<T>(f : Function): (x : T) => Maybe<T>{
-    return (x)=>{
-        var wrapped_old_x : Maybe<T> = {_tag: "Some", value : x};
-        var wrapped_new_x = thenDo(wrapped_old_x, f);
-
-        if (wrapped_new_x._tag != "None"){
-            return wrapped_new_x;
-        }else{
-        return wrapped_old_x;
-        }
-    };
-}
+var typePair = (x : MaybeTokensAST)=> 
+{
+    
+    
+    let a = thenDo(thenDo(x.maybeTokens, typeName), tId);
+    if (a._tag == "Some"){
+        let matched = a.value.matched;
+        let slice = matched.slice(matched.length-2);
+        console.log("slice"+slice);
+
+        let b : MaybeTokensAST = {maybeTokens : a, ast : slice};
+        return b;
+    }
+    else{
+        let b : MaybeTokensAST= {maybeTokens : a, ast : []};
+        return b;
+    }
+} 
 
+/**
+ * function's arguments
+ * FN_ARGS = TYPE_PAIR ("," TYPE_PAIR)+
+ */
 
-export function tokenize(input : string){
-    var input_matchee_pair : Maybe<MatcheePair> = toSome(
-        {matched:"",
-        remained: input});
+var fnArgs = (x : TokenMatcheePair)=>
+    {   
+        let wrapper : MaybeTokensAST = {maybeTokens : toSome(x), ast : []};
+        let a = typePair(wrapper);
+        console.log("AAAAA"+util.inspect(a, { showHidden: true, depth: null })); 
+        let abanibi = typePair(a);
+        console.log("ABNB"+util.inspect(abanibi, { showHidden: true, depth: null })); 
 
-    // integer = ([+]|[-])\d\d?
-    let integer = (x : MatcheePair) => 
-    { let wrapped_x = toSome(x);
-        let plusMinus = orDo(match1Char('+'), match1Char('-')); // ([+]|[-])
-        let d = matchRange('0','9'); // \d
-        return thenDo(thenDo(thenDo(wrapped_x, 
-            zeroOrOnceDo(plusMinus)),d),
-            zeroOrMoreDo(d));
-    }
-    console.log(input+", result: ");
-    console.log(thenDo(input_matchee_pair, integer));
 
-}
+        return {maybeTokens : abanibi.maybeTokens, ast : [a.ast, abanibi.ast]};
+    
+    };
 
-tokenize("+123");
-tokenize("123");
-tokenize("-123");
-tokenize(" 123");
-tokenize("c123");
\ No newline at end of file
+let tree = fnArgs(commandTPair);
+console.log("CHRANN"+util.inspect(tree, { showHidden: true, depth: null }));