root/trunk/src/dmachine.d

/*
 * DGrammar - An OOP grammar compiler for D
 * Copyright (C) 2004  Sjoerd van Leent
 *
 * This program 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 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
module dmachine;

import org.dsource.dmachine.stackmachine;
import std.stdio;

 /++
  + Example bootstrap routine
  +/
int main(char[][] args) {
    if(args.length < 2) {
        writefln("Usage: %s <string>", args[0]);
        return 1;
    }
    wchar[] string;

    foreach(char c; args[1]) {
        string ~= cast(wchar)(c);
    }

    StackMachine machine = new StackMachine(string);
    StackState q0 = new StackState();
    StackState q1 = new StackState();
    StackState q2 = new StackState(true);
    
    StackRule r0 = new StackRule('a', '\0', 'A');
    StackRule r1 = new StackRule('b', '\0', '\0');
    StackRule r2 = new StackRule('a', 'A', '\0');

    StackTransition t0 = new StackTransition(q0);
    StackTransition t1 = new StackTransition(q1);
    StackTransition t2 = new StackTransition(q2);

    r0.addTransition(t0);
    r1.addTransition(t1);
    r2.addTransition(t2);

    q0.addRule(r0);
    q0.addRule(r1);
    q1.addRule(r1);
    q1.addRule(r2);
    q2.addRule(r2);

    StackParsedCollection spc = machine.run(q0);
    if(spc !is null) {
        writefln("Parsed!");
    } else {
        writefln("Parse Error!");
    }
    return 0;
}