import Jison from "jison";

const Parser = Jison.Parser;

const binaryExpression =
  "$$ = {type: 'BINARY_EXPRESSION', left: $1, right: $3, operator: $2, loc: @$}";
const unaryExpression =
  "$$ = {type: 'UNARY_EXPRESSION', value: $2, operator: $1, loc: @$}";

const grammar = {
  comment: "EEL Parser",
  lex: {
    rules: [
      ["\\s+", "/* skip whitespace */"],
      ["[0-9]+", "return 'DIGITS_TOKEN'"],
      ["(==|!=|<=|>=|<|>)", "return 'COMPARISON_TOKEN'"],
      ["[+\\-*/%]?=", "return 'ASSIGNMENT_OPERATOR_TOKEN'"],
      ["(\\&\\&)|\\|\\|", "return 'LOGICAL_OPERATOR_TOKEN'"],
      // https://github.com/justinfrankel/WDL/blob/63943fbac273b847b733aceecdb16703679967b9/WDL/eel2/eel2.l#L93
      ["[a-zA-Z_][a-zA-Z0-9._]*", "return 'IDENTIFIER_TOKEN'"],
      ["$", "return 'EOF'"],
      [".", "return yytext[0]"],
    ],
  },

  operators: [
    // List of operators ordered by precedence. First value is the operators
    // associativity. Operators of the same precedence should be on the same
    // line.
    // https://www.gnu.org/software/bison/manual/bison.html#Precedence
    // TODO: Confirm these orders
    ["right", "ASSIGNMENT_OPERATOR_TOKEN"],
    ["right", "COMPARISON_TOKEN"],
    ["left", "+", "-", "!"],
    ["left", "*", "/"],
    // Unlike many other languages, `^` _is_ left associative in Eel.
    ["left", "%", "^"],
    ["left", "&", "|" /* "~"" will go here as well */],
    ["left", "LOGICAL_OPERATOR_TOKEN"],
    // TODO: Theoretically it should be possible to make `--1` a parse error.
  ],

  bnf: {
    SCRIPT: [
      ["expression EOF", "return {type: 'SCRIPT', body: [$1], loc: @$}"],
      [
        "expressionsOptionalTrailingSemi EOF",
        "return {type: 'SCRIPT', body: $1, loc: @$}",
      ],
      ["EOF", "return {type: 'SCRIPT', body: [], loc: @$}"],
    ],
    separator: [";", "separator ;"],
    expressions: [
      ["expression separator", "$$ = [$1]"],
      ["expressions expression separator", "$$ = $1.concat([$2])"],
    ],
    // This feels like a hack, but I haven't managed to find another way to
    // express optional semicolons while still keeping the grammar unambiguous.
    // Notably this does not allow single expressions to omit the trailing semi.
    expressionsOptionalTrailingSemi: [
      ["expressions", "$$ = $1"],
      ["expressions expression", "$$ = $1.concat([$2])"],
    ],
    EXPRESSION_BLOCK: [
      [
        "expressionsOptionalTrailingSemi",
        "$$ = {type: 'EXPRESSION_BLOCK', body: $1, loc: @$}",
      ],
    ],
    IDENTIFIER: [
      [
        "IDENTIFIER_TOKEN",
        "$$ = {type: 'IDENTIFIER', value: $1.toLowerCase(), loc: @$};",
      ],
    ],
    argument: ["expression", "EXPRESSION_BLOCK"],
    arguments: [
      ["argument", "$$ = [$1]"],
      ["arguments , argument", "$$ = $1.concat([$3])"],
    ],
    FUNCTION_CALL: [
      [
        "IDENTIFIER ( )",
        "$$ = {type: 'CALL_EXPRESSION', callee: $1, arguments: [], loc: @$}",
      ],
      [
        "IDENTIFIER ( arguments )",
        "$$ = {type: 'CALL_EXPRESSION', callee: $1, arguments: $3, loc: @$}",
      ],
    ],
    LOGICAL_EXPRESSION: [
      [
        "expression LOGICAL_OPERATOR_TOKEN expression",
        "$$ = {type: 'LOGICAL_EXPRESSION', left: $1, right: $3, operator: $2, loc: @$}",
      ],
    ],
    ASSIGNMENT: [
      [
        "IDENTIFIER ASSIGNMENT_OPERATOR_TOKEN expression",
        "$$ = {type: 'ASSIGNMENT_EXPRESSION', left: $1, operator: $2, right: $3, loc: @$}",
      ],
      [
        "FUNCTION_CALL ASSIGNMENT_OPERATOR_TOKEN expression",
        "$$ = {type: 'ASSIGNMENT_EXPRESSION', left: $1, operator: $2, right: $3, loc: @$}",
      ],
    ],
    number: [
      ["DIGITS_TOKEN", "$$ = Number($1)"],
      ["DIGITS_TOKEN .", "$$ = Number($1)"],
      ["DIGITS_TOKEN . DIGITS_TOKEN", "$$ = Number($1 + $2 + $3)"],
      [". DIGITS_TOKEN", "$$ = Number('0' + $1 + $2)"],
      [".", "$$ = 0"],
    ],
    NUMBER_LITERAL: [
      ["number", "$$ = {type: 'NUMBER_LITERAL', value: $1, loc: @$}"],
    ],
    UNARY_EXPRESSION: [
      ["- expression", unaryExpression],
      ["+ expression", unaryExpression],
      ["! expression", unaryExpression],
    ],
    BINARY_EXPRESSION: [
      ["expression + expression", binaryExpression],
      ["expression - expression", binaryExpression],
      ["expression * expression", binaryExpression],
      ["expression / expression", binaryExpression],
      ["expression % expression", binaryExpression],
      ["expression & expression", binaryExpression],
      ["expression | expression", binaryExpression],
      ["expression ^ expression", binaryExpression],
      ["expression COMPARISON_TOKEN expression", binaryExpression],
    ],
    expression: [
      "BINARY_EXPRESSION",
      "UNARY_EXPRESSION",
      ["( expression )", "$$ = $2"],
      "NUMBER_LITERAL",
      "ASSIGNMENT",
      "FUNCTION_CALL",
      "IDENTIFIER",
      "LOGICAL_EXPRESSION",
      ["( EXPRESSION_BLOCK )", "$$ = $2"],
    ],
  },
};

var parser = new Parser(grammar);

const settings = {
  moduleType: "js",
  // Without this Jison defaults to including a commandline interface to the generated module.
  moduleMain: () => {},
};

// Remove unused label: `_token_stack:`;

const unusedLabel = "_token_stack:";

// jison does not support es modules so we do it ourselves.
const mod = `${parser.generateModule(settings).replace(unusedLabel, "")}
export function parse() {
  return parser.parse.apply(parser, arguments);
};
`;
console.log(mod);