english breakline, and generate try to count the text size

[clo] / src / index.ts

diff --git a/src/index.ts b/src/index.ts
index 3c3384d520bc8bf8d6e54bd6f00bbf47cf909ee2..44aa79282788f7f8fd28679017ceb114c49c3149 100644 (file)
--- a/src/index.ts
+++ b/src/index.ts
@@ -1,74 +1,68 @@
 var fs = require('fs');
+var argv : any = require('minimist')(process.argv.slice(2));
 
-type Some<T> = { _tag: "Some"; value: T };
-type None = {_tag: "None"};
+import * as parser from "./parser.js";
 
 /**
- * @description Like the `Some(a)` and `None` in Rust.
- *
- * @example
- * ```ts
- * let exam1 : Maybe<Number> = { _tag: "Some", value: 12 };
- * let exam2 : Maybe<Number> = None;
- * ```
+ * help for inputing `--help` parameter.
  */
-export type Maybe<T> = Some<T> | None;
+export let helpDesc =
+`
+clo: clo INPUT_FILE --output-js OUTPUT_JS_FILE
 
+\ta little typesetter powered by TypeScript/Javascript.
+
+## Arguments
+INPUT_FILE\tan input .clo file
+
+## Parameters
+---
+--output-js\tgenerated the output middle JS file
 
-/**
- * @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};
+
+Report bugs to: clo@kianting.info
+clo home page: <https://kianting.info/wiki/w/Project:Clo>
+`
+
+processArgv(argv, helpDesc);
 
 /**
- * @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
- * in `Some`. Otherwise, it returns `None`.
- *  * @param c : the char to be test.
- * @returns the updated `MatchedPair` wrapped in `Some(x)` or `None`.
+ * processing the passed `argv` (arguments)
  */
-export function match1Char(c : string) : (m: MatcheePair) => Maybe<MatcheePair> {
-    return (m : MatcheePair)=>{
-        const charToBeMatched = m.remained[0];
-        if (charToBeMatched === c){
-            return {_tag: "Some", value :{
-                    matched : m.matched + charToBeMatched,
-                    remained : m.remained.substring(1)}};
-        }
-        else{
-            return {_tag: "None"};
-        }
+
+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'];
+
+    if (inputFile.length > 1){
+        console.log("Sorry, the input file should be only one.");
     }
-};
 
-/**
- * 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.`);
+    /** output --help */
+    if (helpTriggered || NoInputFile || NoOutputJSFile){
+        console.log(helpDesc);
     }else{
-        return s.charCodeAt(0);
-    }
-}
+        fs.readFile(inputFile[0], 'utf8', (err : Error, inputText : string) => {
+            if (err) throw err;
 
-/**
- *  @description thendo(input, f, ...) like
- * a ==> f
- */
-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);
+            let tree = parser.inputTextToTree(inputText);
+
+            let output = parser.treeToJS(tree);
+
+            fs.writeFile(outputJSFile, output , (err : Error) => {
+                if (err) throw err;
+              });
+
+          }); 
     }
+
 }
+
+
+
+
+