X-Git-Url: https://git.kianting.info/?a=blobdiff_plain;f=src%2Findex.ts;h=44aa79282788f7f8fd28679017ceb114c49c3149;hb=c3dc58d74afa6b298d84bad90d63c027a32a954a;hp=599d32a9040ef78c4127eff01698f54b0aa95ab1;hpb=9784854866f652eb2118c390425a6cbe7a702ab1;p=clo diff --git a/src/index.ts b/src/index.ts index 599d32a..44aa792 100644 --- a/src/index.ts +++ b/src/index.ts @@ -1,380 +1,68 @@ var fs = require('fs'); -import { argv, resourceUsage } from 'node:process'; -import * as tk from './tokenize.js'; -import * as util from 'util'; -import { drawEllipsePath, reduceRotation } from 'pdf-lib'; -import { isAnyArrayBuffer, isTypedArray } from 'node:util/types'; -import { error } from 'node:console'; -import { isUndefined } from 'node:util'; +var argv : any = require('minimist')(process.argv.slice(2)); -/** - * debug reprensenting - */ -let repr = (x : any)=>{return util.inspect(x, {depth: null})}; - -/** - * token tree type. - */ -type tkTree = tkTree[] | tk.Token +import * as parser from "./parser.js"; /** - * 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. + * help for inputing `--help` parameter. */ -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."); - - } -} +export let helpDesc = +` +clo: clo INPUT_FILE --output-js OUTPUT_JS_FILE -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."); - - } -} +\ta little typesetter powered by TypeScript/Javascript. -/** - * 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[] -} +## Arguments +INPUT_FILE\tan input .clo file -/** - * convert a `tkTree` AST to S-expr string - * @param t the `tkTree` - * @returns S-expr String - */ -export function tkTreeToSExp(t: tkTree): string{ - var str = ""; +## Parameters +--- +--output-js\tgenerated the output middle JS file - if (Array.isArray(t)){ - let strArray = t.map((x)=>tkTreeToSExp(x)); - str = "(" + strArray.join(" ") + ")"; - }else{ - if (t=== undefined){ - str = "%undefined" - }else{ - str = t.text; - } - } - return str; -} +Report bugs to: clo@kianting.info +clo home page: +` -/** - * @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`. - */ -export function m1TType(typ: tk.TokenType): - (m: TokenMatcheePair) => tk.Maybe { - return (m: TokenMatcheePair) => { - if (m.remained.length == 0) { - return { _tag: "None" }; - } - /** - * token to be matched - * */ - const ttbm = m.remained[0]; - - if (ttbm.type == typ) { - let new_matched = m.matched.concat(ttbm); - let result : tk.Some = { - _tag: "Some", value: { - matched: new_matched, - remained: m.remained.slice(1), - ast: ([ttbm]), - } - }; - return result; - } - else { - return { _tag: "None" }; - } - } -}; +processArgv(argv, helpDesc); /** - * type int + * processing the passed `argv` (arguments) */ -let tInt = m1TType(tk.TokenType.INT); -let tId = m1TType(tk.TokenType.ID); - - -let tAdd = m1TType(tk.TokenType.I_ADD); -let tSub = m1TType(tk.TokenType.I_SUB); -let tMul = m1TType(tk.TokenType.I_MUL); -let tDiv = m1TType(tk.TokenType.I_DIV); -let tLParen = m1TType(tk.TokenType.L_PAREN); -let tRParen = m1TType(tk.TokenType.R_PAREN); -let toSome = tk.toSome; +export function processArgv(argv : any, helpDesc : string){ + let inputFile : string[] = argv['_']; + let outputJSFile : string | true = argv['output-js']; + let NoInputFile : boolean = (inputFile.length == 0); + let NoOutputJSFile : boolean = (outputJSFile === undefined || outputJSFile == true); + let helpTriggered : boolean = argv['help']; -argv.forEach((val, index) => { - console.log(`${index}=${val}`); -}); - - -/** - * like `m ==> f` in ocaml - * @param m matchee wrapped - * @param f matching function - * @returns wrapped result - */ -function thenDo(m : tk.Maybe, f : Function){ - if (m._tag == "None"){ - return m; - }else{ - var a : tk.Maybe = f(m.value); - if (a._tag == "Some"){ - a.value.ast = concat(m.value.ast, a.value.ast); - } - - return a; + if (inputFile.length > 1){ + console.log("Sorry, the input file should be only one."); } -} - -/** - * 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 : TokenMatcheePair) =>{ - let res1 : tk.Maybe = f1(x); - if (res1._tag == "Some"){ - return res1; - }else{ - let res2 : tk.Maybe = f2(x); - return res2; - } - } -} - - -/** - * - * @param m : the `MatcheePair` 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`. - */ -export function matchAny(m: TokenMatcheePair): tk.Maybe { - 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" }; - } -} - -/** - * Danger : Maybe it's not enough to work. -* @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 OnceOrMoreDo(f: Function): (x: TokenMatcheePair) => - tk.Maybe { - return (x) => { - var wrappedOldX: tk.Maybe = { _tag: "Some", value: x }; - var wrappedNewX: tk.Maybe = wrappedOldX; - - var counter = -1; - - while (wrappedNewX._tag != "None") { - wrappedOldX = wrappedNewX; - wrappedNewX = thenDo(wrappedOldX, f); - counter += 1; - - }; - - if (counter <= 0){ - return { _tag: "None"}; - } - let ast = wrappedOldX.value.ast ; - wrappedOldX.value.ast =ast.slice(ast.length-counter); - console.log(repr(wrappedOldX.value.ast)); + /** output --help */ + if (helpTriggered || NoInputFile || NoOutputJSFile){ + console.log(helpDesc); + }else{ + fs.readFile(inputFile[0], 'utf8', (err : Error, inputText : string) => { + if (err) throw err; - return wrappedOldX; }; -} + let tree = parser.inputTextToTree(inputText); -/** - * aux function for midfix operator - * @param f function - * @param signal the rule name - * @returns - */ -let midfix = (f : Function, signal? : string) => (x : TokenMatcheePair)=>{ - var a = f(x); - if (a._tag == "Some"){ - let ast_tail : tkTree[] = slice(a.value.ast,a.value.ast.length-3); - let new_ast = [ast_tail]; - a.value.ast = new_ast; + let output = parser.treeToJS(tree); - // console.log("+"+signal+"+"+repr(a)); + fs.writeFile(outputJSFile, output , (err : Error) => { + if (err) throw err; + }); - + }); } - return a; -} -let circumfix = (f : Function, signal? : string) => (x : TokenMatcheePair)=>{ - var a = f(x); - if (a._tag == "Some"){ - let inner = a.value.ast[a.value.ast.length-2]; - let ast_middle : tkTree[] = [inner]; - let new_ast = [ast_middle]; - a.value.ast = new_ast; - } - return a; } -/** - * TODO: 12(13)(14) only parsed with only 12(13) - */ -/** single1 = tInt | "(" expr ")"*/ -let single1 = circumfix((x : TokenMatcheePair) => - thenDo(thenDo(thenDo(tk.toSome(x), tLParen), expr), tRParen), "fac1"); -let single2= tInt; -let single = orDo(single1, single2); - -/** func = single | single "(" single ")" - * i.e. - * - * func = single | func_aux ( int ) - * -*/ - - -/** fac = single ["(" single ")"]? | single - * Issue1 to be fixed. - */ -let fac1Appliee = circumfix((x : TokenMatcheePair) => thenDo(thenDo(thenDo(tk.toSome(x), tLParen), tInt), tRParen), "fac1"); -let fac1 = (x : TokenMatcheePair) => - { - let raw = thenDo(thenDo(toSome(x), single), OnceOrMoreDo(fac1Appliee)); - - - - if (raw._tag == "Some"){ - - - var result : tkTree = raw.value.ast[0]; - let applyToken : tk.Token = {text: '%apply', ln:0, col:0}; - for (var i=1; i - thenDo(thenDo(thenDo(tk.toSome(x), fac), orDo(tMul,tDiv)), fac), "term1"); - - -/** - * - * term2 = int MUL int - */ -let term2 = fac; - -/** - * term = term1 | term2 - */ -let term = orDo(term1, term2); - -/** - * - * expr1 = term ADD term - */ -let expr1 = midfix((x : TokenMatcheePair)=> - thenDo(thenDo(thenDo(tk.toSome(x), term), orDo(tAdd,tSub)), term), "expr1"); -/** - * expr2 = term - */ -let expr2 = term; -/** - * expr = expr1 | expr2 - */ -let expr = orDo(expr1, expr2); - - - -let tokens = tk.tokenize("1"); -let tokens2 = tk.tokenize("1(2)"); -let tokens3 = tk.tokenize("1(2)(3)"); -let tokens4 = tk.tokenize("(3(2))*2+1"); - -//let tokens = tk.tokenize("(4-(3/4))"); -//tk.tokenize(argv[2]); - -let tokensFiltered = tokens4.filter( - (x)=>{return (x.type != tk.TokenType.NL - && x.type != tk.TokenType.SP)}); - - - -let beta = expr({ - matched : [] , - remained : tokensFiltered, - ast : []}); - -if (beta._tag == "Some"){ - console.log(tkTreeToSExp(beta.value.ast)); -} -console.log("RESULT="+repr(beta));