Package eas.math.fundamentalAlgorithms.graphBased.algorithms.type0grammars

Examples of eas.math.fundamentalAlgorithms.graphBased.algorithms.type0grammars.Grammar

122
123
124
125
126
127
128
129
130
131
132
        if (dia.getDirectory() == null || dia.getFile() == null) {
            env.getSimTime().timeTerminate();
            System.exit(0);
        }
       
        grammar = new Grammar(new File(dia.getDirectory() + File.separator + dia.getFile()), new Nonterminal(new StringBuffer("S")));
       
        env.addAgent(
                new GrammarAgent(
                        env.getFirstFreeID(),
                        env,
View Full Code Here
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
       
        return "";
    }

    public Grammar generateType3Grammar() {
        Grammar g = new Grammar(new Nonterminal(new StringBuffer(this.initialState)));

        LinkedList<String> reachableStates = new LinkedList<>(this.getAllReachableStates());
       
        Collections.sort(reachableStates);
       
        for (String fromState : reachableStates) {
            for (Transition targetTransition : this.getTransitionsFrom(fromState)) {
                String toState = targetTransition.getDestination();
                String symbol = targetTransition.getLabel();
               
                g.addRule(new Rule(
                        new Word(new Symbol[] {new Nonterminal(new StringBuffer(fromState))}),
                        new Word(new Symbol[] {
                                new Terminal(new StringBuffer(symbol)),
                                new Nonterminal(new StringBuffer(toState))})));
            }
           
            if (this.finalStates.contains(fromState)) {
                g.addRule(new Rule(
                        new Word(new Symbol[] {new Nonterminal(new StringBuffer(fromState))}),
                        new Word(new Symbol[] {})));
            }
        }
       
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
        super.runBeforeSimulation(umg, params);
        LinkedList<RepresentableAsGraph> list = new LinkedList<RepresentableAsGraph>();
        list.add(new FSM());
        list.add(new PDA());
        list.add(new Turing());
        list.add(new Grammar());
        list.add(new BDD());
        list.add(new Huffman());
        list.add(new PlainDOT());
        list.add(new PatTree());
        list.add(new MARB());
View Full Code Here
TOP

Related Classes of eas.math.fundamentalAlgorithms.graphBased.algorithms.type0grammars.Grammar

  • eas.math.fundamentalAlgorithms.graphBased.algorithms.fsm.FSM
  • eas.math.fundamentalAlgorithms.graphBased.pdfProcessors.GraphViz
  • eas.math.fundamentalAlgorithms.graphBased.plugin.GraphBasedPlugin
  • eas.math.fundamentalAlgorithms.graphBased.script.FancyJButton
  • eas.math.fundamentalAlgorithms.type2grammars.charty.CtxtFreeGrammar
  • eas.users.demos.grammar.GrammarScheduler
  • javax.swing.JPanel
  • java.awt.event.MouseListener
  • java.io.FileReader
  • java.io.BufferedReader
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.