parser.java

This is my implementation for linear programming

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package ro.utils;

import java.util.ArrayList;
import ro.simplex.*;

/**
 *
 * @author Doan Chien Thang
 */
public class Parser {
    protected ArrayList<Variable> vars = new ArrayList<Variable>();
    
    public Objective parseObjective(String objInput) {
        String elements[] = objInput.split("=");
        int type = elements[1].compareTo("max") == 0 ?
            Objective.MAXIMIZE : Objective.MINIMIZE;
        String tmp = "";
        for (int i = 0; i < elements[0].length(); i++) {
            if (elements[0].charAt(i) == '+' || elements[0].charAt(i) == '-')
                tmp += "*";
            if (elements[0].charAt(i) != ' ')
                tmp += elements[0].charAt(i);
        }
        System.out.println(tmp);
        String varsStr[] = tmp.split("\\*");
        for (int i = 0; i < varsStr.length; i++)
            System.out.printf("%10s", varsStr[i]);
        System.out.println();
        return null;
    }

    public ArrayList<Constraint> parseConstraints(String consInput) {
        return null;
    }

    public Problem parse(String objInput, String consInput) {
        return null;
    }

    public static void main(String[] args) {
        Parser p = new Parser();
        Objective s = p.parseObjective("x1 + x2 - x3 = max");
    }
}