import { argv, resourceUsage } from 'node:process';
import * as tk from './tokenize.js';
import * as util from 'util';
-import { reduceRotation } from 'pdf-lib';
+import { drawEllipsePath, reduceRotation } from 'pdf-lib';
+import { isTypedArray } from 'node:util/types';
+import { error } from 'node:console';
+
+/**
+ * debug reprensenting
+ */
+let repr = (x : any)=>{return util.inspect(x, {depth: null})};
/**
* token tree type.
*/
type tkTree = tkTree[] | tk.Token
-export interface TokenMatcheePair {
- matched: tkTree[]
- remained: tk.Token[]
+/**
+ * concated 2 `tkTree`s
+ * @param x the array to be concated
+ * @param y the item or array to ve concated
+ * @returns concated tkTree array, or thrown error if can't be concated.
+ */
+function concat(x: tkTree, y:tkTree): tkTree[] {
+ if (Array.isArray(x)){
+ return x.concat(y);
+ }else{
+ throw new Error("the tkTree can't be concated, because it's not an array.");
+
+ }
+}
+
+function slice(x: tkTree, index?:number, end?:number): tkTree[] {
+ if (Array.isArray(x)){
+ return x.slice(index,end);
+ }else{
+ throw new Error("the tkTree can't be concated, because it's not an array.");
+
+ }
}
-export interface MaybeTokensAST{
- maybeTokens: tk.Maybe<TokenMatcheePair>;
- ast: tkTree;
+/**
+ * TokenMatcheePair for tokens' parser combinator
+ * matched: the matched (now and before) tokens
+ * remained: tokens to be matched
+ * ast: abstract syntax tree
+ */
+export interface TokenMatcheePair {
+ matched: tk.Token[]
+ remained: tk.Token[]
+ ast : tkTree[]
}
/**
let result : tk.Some<TokenMatcheePair> = {
_tag: "Some", value: {
matched: new_matched,
- remained: m.remained.slice(1)
+ remained: m.remained.slice(1),
+ ast: ([ttbm]),
}
};
return result;
}
};
-let toSome = tk.toSome;
-let thenDo = tk.thenDo;
-let zeroOrOnceDo = tk.zeroOrOnceDo;
-let orDo = tk.orDo;
-let zeroOrMoreDo = tk.zeroOrMoreDo;
+/**
+ * type int
+ */
+let tInt = m1TType(tk.TokenType.INT);
+let tAdd = m1TType(tk.TokenType.I_ADD);
+let tMul = m1TType(tk.TokenType.I_MUL);
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 }));
/**
- * matchee pair of commandInputTokenized
+ * like `m ==> f` in ocaml
+ * @param m matchee wrapped
+ * @param f matching function
+ * @returns wrapped result
*/
-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));
+function thenDo(m : tk.Maybe<TokenMatcheePair>, f : Function){
+ if (m._tag == "None"){
+ return m;
}else{
- return {_tag : "None"};
+ var a : tk.Maybe<TokenMatcheePair> = f(m.value);
+ if (a._tag == "Some"){
+ a.value.ast = concat(m.value.ast, 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.
+ * like `f1 | f2` in regex
+ * @param f1 the first tried function
+ * @param f2 the second tried function
+ * @returns wrapped result
*/
-function gramRHS (process: Function, arrange : number[]){
- return (m : TokenMatcheePair)=>{
+function orDo(f1 : Function, f2 : Function){
+ return (x : TokenMatcheePair) =>{
+ let res1 : tk.Maybe<TokenMatcheePair> = f1(x);
+ if (res1._tag == "Some"){
+ return res1;
+ }else{
+ let res2 : tk.Maybe<TokenMatcheePair> = f2(x);
+ return res2;
+ }
+ }
+
+}
- let middle : tk.Maybe<TokenMatcheePair> = process(m);
+let midfix = (f : Function, signal? : string) => (x : TokenMatcheePair)=>{
+ var a = f(x);
+ if (a._tag == "Some"){
+ let ast_head : tkTree[] = slice(a.value.ast,0,a.value.ast.length-3);
+ let ast_tail : tkTree[] = slice(a.value.ast,a.value.ast.length-3);
+ let new_ast = [ast_tail];
+ a.value.ast = new_ast;
- console.log("Middle"+util.inspect(middle, { showHidden: true, depth: null }));
+ console.log("+"+signal+"+"+repr(a));
- 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);
-
-
- let result : tk.Some<TokenMatcheePair> = {_tag:"Some",
- value : {matched : matchedTmp1,
- remained : middle.value.remained}};
- return result;
- }
}
+ return a;
}
/**
- * typeABS ::= "'" ID
+ *
+ * fac1 = int MUL int
*/
-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;
+//let fac1 = midfix((x : TokenMatcheePair)=>
+// thenDo(thenDo(thenDo(tk.toSome(x), tInt), tMul), tInt));
+
+let fac1 = (x : TokenMatcheePair) => {
+ let a = midfix((x : TokenMatcheePair)=>
+ thenDo(thenDo(thenDo(tk.toSome(x), tInt), tMul), tInt), "fac1")(x);
+
+ return a;
}
+
/**
- * TypeId ::= typeABS | ID
+ *
+ * fac2 = int MUL int
*/
-var typeName = (x : TokenMatcheePair)=>
-{
- return thenDo(toSome(x), orDo(typeABS, tId));
-}
+let fac2 = tInt;
/**
- * CONST ::= INT | STR | FLO | BOOL
+ * fac = fac1 | fac2
*/
+let fac = orDo(fac1, fac2);
+
/**
- * TODO: 要用 debugger 檢查分析問題
+ *
+ * expr1 = fac ADD fac
*/
-var constParser = gramRHS((x : TokenMatcheePair)=>
- {return thenDo(toSome(x),orDo(orDo(orDo(tInt,tFlo),tStr),tBool))}, [0]);
-
+let expr1 = midfix((x : TokenMatcheePair)=>
+ thenDo(thenDo(thenDo(tk.toSome(x), fac), tAdd), fac), "expr1");
/**
- * storing the tree
+ * expr2 = fac
*/
-var astTree : tkTree = [];
+let expr2 = fac;
/**
- * TYPE_PAIR ::= TYP_ID ID
+ * expr = expr1 | expr2
*/
-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 expr = orDo(expr1, expr2);
- 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)+
- */
-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 }));
+let tokens = tk.tokenize("2+3*4");//tk.tokenize(argv[2]);
+let tokensFiltered = tokens.filter(
+ (x)=>{return (x.type != tk.TokenType.NL
+ && x.type != tk.TokenType.SP)});
- return {maybeTokens : abanibi.maybeTokens, ast : [a.ast, abanibi.ast]};
-
- };
+let wrappedTokens : tk.Maybe<TokenMatcheePair> =
+ tk.toSome({
+ matched : [] ,
+ remained : tokensFiltered,
+ ast : []});
+
+let beta = expr({
+ matched : [] ,
+ remained : tokensFiltered,
+ ast : []});
+
+console.log(repr(wrappedTokens));
+
+console.log(repr(beta));
-let tree = fnArgs(commandTPair);
-console.log("CHRANN"+util.inspect(tree, { showHidden: true, depth: null }));