cc.redberry.core.parser.Parser Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of core Show documentation

Redberry is an open source computer algebra system designed for tensor manipulation. It implements basic computer algebra system routines as well as complex tools for real computations in physics. This is Redberry core, which contains the implementation of the basic computer algebra routines and general-purpose transformations.

There is a newer version: 1.1.10

Show newest version

/*
 * Redberry: symbolic tensor computations.
 *
 * Copyright (c) 2010-2015:
 *   Stanislav Poslavsky   
 *   Bolotin Dmitriy       
 *
 * This file is part of Redberry.
 *
 * Redberry is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Redberry is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Redberry. If not, see .
 */
package cc.redberry.core.parser;

import java.util.Arrays;

/**
 * Parser of mathematical expressions.
 *
 * @author Dmitry Bolotin
 * @author Stanislav Poslavsky
 * @since 1.0
 */
public final class Parser {
    /**
     * Default parser.
     */
    public static final Parser DEFAULT =
            new Parser(ParserBrackets.INSTANCE,
                    ParserSum.INSTANCE,
                    ParserProduct.INSTANCE,
                    ParserSimpleTensor.INSTANCE,
                    ParserTensorField.INSTANCE,
                    ParserDerivative.INSTANCE,
                    ParserPower.INSTANCE,
                    ParserNumber.INSTANCE,
                    ParserFunctions.INSTANCE,
                    ParserExpression.INSTANCE,
                    ParserPowerAst.INSTANCE);
    private final TokenParser[] tokenParsers;

    /**
     * Constructs Parser from a given parsers of AST nodes.
     *
     * @param tokenParsers
     */
    public Parser(TokenParser... tokenParsers) {
        this.tokenParsers = tokenParsers;
        Arrays.sort(tokenParsers, NodeParserComparator.INSTANCE);
    }

    /**
     * Parse string expression into AST.
     *
     * @param expression string expression
     * @return AST
     */
    public ParseToken parse(String expression) {
        //replacing comments
        expression = expression.replaceAll("//.*|(\"(?:\\\\[^\"]|\\\\\"|.)*?\")|(?s)/\\*.*?\\*/","");
        //join strings
        expression = expression.replaceAll("\n","");
        if (expression.isEmpty())
            throw new IllegalArgumentException("Empty expression.");
        for (TokenParser tokenParser : tokenParsers) {
            ParseToken node = tokenParser.parseToken(expression.trim(), this);
            if (node != null)
                return node;
        }
        throw new ParserException("No appropriate parser for expression: \"" + expression + "\"");
    }
}