propositional/lib/transform/toString.js

Propositional logic symbolic computation library

"use strict";
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
    if (k2 === undefined) k2 = k;
    var desc = Object.getOwnPropertyDescriptor(m, k);
    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
      desc = { enumerable: true, get: function() { return m[k]; } };
    }
    Object.defineProperty(o, k2, desc);
}) : (function(o, m, k, k2) {
    if (k2 === undefined) k2 = k;
    o[k2] = m[k];
}));
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
    Object.defineProperty(o, "default", { enumerable: true, value: v });
}) : function(o, v) {
    o["default"] = v;
});
var __importStar = (this && this.__importStar) || function (mod) {
    if (mod && mod.__esModule) return mod;
    var result = {};
    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
    __setModuleDefault(result, mod);
    return result;
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.toString = void 0;
const AST = __importStar(require("../syntax/ast"));
let fancyOperator = (lexeme) => {
    switch (lexeme) {
        case '!':
            return '¬';
        case '&':
            return '∧';
        case '|':
            return '∨';
        case '^':
            return '⊕';
        case '=>':
            return '⇒';
        case '<=>':
            return '⇔';
        default:
            return lexeme;
    }
};
function toString(expression, pretty = false) {
    switch (true) {
        case expression instanceof AST.BinaryExpression: {
            let operator = expression.operator.lexeme;
            if (pretty)
                operator = ' ' + fancyOperator(operator) + ' ';
            return '(' + toString(expression.left, pretty) + operator + toString(expression.right, pretty) + ')';
        }
        case expression instanceof AST.UnaryExpression: {
            let operator = expression.operator.lexeme;
            if (pretty)
                operator = fancyOperator(operator);
            return operator + toString(expression.inner, pretty);
        }
        case expression instanceof AST.Literal:
            return expression.value.lexeme;
    }
}
exports.toString = toString;