1
0
mirror of https://github.com/DanilaFe/abacus synced 2026-09-27 13:52:32 +00:00

More around files into more applicable packages.

This commit is contained in:
2017-09-23 23:43:08 -07:00
parent d7bb838866
commit c990d4c50a
65 changed files with 164 additions and 102 deletions

View File

@@ -1,9 +1,8 @@
package org.nwapw.abacus.lexing;
import org.nwapw.abacus.lexing.pattern.EndNode;
import org.nwapw.abacus.lexing.pattern.Match;
import org.nwapw.abacus.lexing.pattern.nodes.EndNode;
import org.nwapw.abacus.lexing.pattern.Pattern;
import org.nwapw.abacus.lexing.pattern.PatternNode;
import org.nwapw.abacus.lexing.pattern.nodes.PatternNode;
import java.util.*;

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing;
/**
* A match that has been generated by the lexer.

View File

@@ -1,5 +1,7 @@
package org.nwapw.abacus.lexing.pattern;
import org.nwapw.abacus.lexing.pattern.nodes.*;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
@@ -88,7 +90,7 @@ public class Pattern<T> {
* @return the modified chain.
*/
private PatternChain<T> transformPlus(PatternChain<T> chain) {
chain.tail.outputStates.add(chain.head);
chain.tail.getOutputStates().add(chain.head);
return chain;
}
@@ -102,10 +104,10 @@ public class Pattern<T> {
private PatternChain<T> transformStar(PatternChain<T> chain) {
LinkNode<T> newTail = new LinkNode<>();
LinkNode<T> newHead = new LinkNode<>();
newHead.outputStates.add(chain.head);
newHead.outputStates.add(newTail);
chain.tail.outputStates.add(newTail);
newTail.outputStates.add(newHead);
newHead.getOutputStates().add(chain.head);
newHead.getOutputStates().add(newTail);
chain.tail.getOutputStates().add(newTail);
newTail.getOutputStates().add(newHead);
chain.head = newHead;
chain.tail = newTail;
return chain;
@@ -121,9 +123,9 @@ public class Pattern<T> {
private PatternChain<T> transformQuestion(PatternChain<T> chain) {
LinkNode<T> newTail = new LinkNode<>();
LinkNode<T> newHead = new LinkNode<>();
newHead.outputStates.add(chain.head);
newHead.outputStates.add(newTail);
chain.tail.outputStates.add(newTail);
newHead.getOutputStates().add(chain.head);
newHead.getOutputStates().add(newTail);
chain.tail.getOutputStates().add(newTail);
chain.head = newHead;
chain.tail = newTail;
return chain;
@@ -140,8 +142,8 @@ public class Pattern<T> {
LinkNode<T> tail = new LinkNode<>();
PatternChain<T> newChain = new PatternChain<>(head, tail);
for (PatternChain<T> chain : collection) {
head.outputStates.add(chain.head);
chain.tail.outputStates.add(tail);
head.getOutputStates().add(chain.head);
chain.tail.getOutputStates().add(tail);
}
return newChain;
}

View File

@@ -1,5 +1,7 @@
package org.nwapw.abacus.lexing.pattern;
import org.nwapw.abacus.lexing.pattern.nodes.PatternNode;
/**
* A chain of nodes that can be treated as a single unit.
* Used during pattern compilation.
@@ -56,7 +58,7 @@ public class PatternChain<T> {
this.head = other.head;
this.tail = other.tail;
} else {
tail.outputStates.add(other.head);
tail.getOutputStates().add(other.head);
tail = other.tail;
}
}
@@ -72,7 +74,7 @@ public class PatternChain<T> {
if (tail == null) {
head = tail = node;
} else {
tail.outputStates.add(node);
tail.getOutputStates().add(node);
tail = node;
}
}

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing.pattern.nodes;
/**
* A pattern node that matches any character.

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing.pattern.nodes;
/**
* A node that represents a successful match.

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing.pattern.nodes;
import java.util.Collection;

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing.pattern.nodes;
import java.util.Collection;
import java.util.HashSet;
@@ -65,4 +65,11 @@ public class PatternNode<T> {
outputStates.forEach(e -> e.addInto(into));
}
/**
* Gets the output states of this node.
* @return the output states.
*/
public Set<PatternNode<T>> getOutputStates() {
return outputStates;
}
}

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing.pattern.nodes;
/**
* A node that matches a range of characters.

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.lexing.pattern;
package org.nwapw.abacus.lexing.pattern.nodes;
/**
* A node that matches a single value.

View File

@@ -1,4 +1,6 @@
package org.nwapw.abacus.number;
package org.nwapw.abacus.number.standard;
import org.nwapw.abacus.number.NumberInterface;
/**
* An implementation of NumberInterface using a double.

View File

@@ -1,4 +1,6 @@
package org.nwapw.abacus.number;
package org.nwapw.abacus.number.standard;
import org.nwapw.abacus.number.NumberInterface;
import java.math.BigDecimal;
import java.math.MathContext;

View File

@@ -1,12 +1,12 @@
package org.nwapw.abacus.parsing;
package org.nwapw.abacus.parsing.standard;
import org.nwapw.abacus.exception.TokenizeException;
import org.nwapw.abacus.lexing.Lexer;
import org.nwapw.abacus.lexing.pattern.Match;
import org.nwapw.abacus.lexing.Match;
import org.nwapw.abacus.lexing.pattern.Pattern;
import org.nwapw.abacus.parsing.Tokenizer;
import org.nwapw.abacus.plugin.PluginListener;
import org.nwapw.abacus.plugin.PluginManager;
import org.nwapw.abacus.tree.TokenType;
import java.util.Comparator;
import java.util.List;

View File

@@ -1,13 +1,14 @@
package org.nwapw.abacus.parsing;
package org.nwapw.abacus.parsing.standard;
import org.nwapw.abacus.exception.ParseException;
import org.nwapw.abacus.function.Operator;
import org.nwapw.abacus.function.OperatorAssociativity;
import org.nwapw.abacus.function.OperatorType;
import org.nwapw.abacus.lexing.pattern.Match;
import org.nwapw.abacus.lexing.Match;
import org.nwapw.abacus.parsing.Parser;
import org.nwapw.abacus.plugin.PluginListener;
import org.nwapw.abacus.plugin.PluginManager;
import org.nwapw.abacus.tree.*;
import org.nwapw.abacus.tree.nodes.*;
import java.util.*;
@@ -162,7 +163,7 @@ public class ShuntingYardParser implements Parser<Match<TokenType>>, PluginListe
matches.remove(0);
CallNode node;
if (matchType == TokenType.FUNCTION) {
node = new FunctionNode(functionName, children);
node = new NumberFunctionNode(functionName, children);
} else {
node = new TreeValueFunctionNode(functionName, children);
}

View File

@@ -1,4 +1,4 @@
package org.nwapw.abacus.tree;
package org.nwapw.abacus.parsing.standard;
/**
* Enum to represent the type of the token that has been matched

View File

@@ -1,6 +1,10 @@
package org.nwapw.abacus.plugin;
import org.nwapw.abacus.function.*;
import org.nwapw.abacus.function.interfaces.NumberFunction;
import org.nwapw.abacus.function.interfaces.NumberOperator;
import org.nwapw.abacus.function.interfaces.TreeValueFunction;
import org.nwapw.abacus.function.interfaces.TreeValueOperator;
import org.nwapw.abacus.number.NumberInterface;
/**

View File

@@ -2,6 +2,10 @@ package org.nwapw.abacus.plugin;
import org.nwapw.abacus.Abacus;
import org.nwapw.abacus.function.*;
import org.nwapw.abacus.function.interfaces.NumberFunction;
import org.nwapw.abacus.function.interfaces.NumberOperator;
import org.nwapw.abacus.function.interfaces.TreeValueFunction;
import org.nwapw.abacus.function.interfaces.TreeValueOperator;
import org.nwapw.abacus.number.NumberInterface;
import java.lang.reflect.InvocationTargetException;

View File

@@ -2,9 +2,12 @@ package org.nwapw.abacus.plugin.standard;
import org.nwapw.abacus.context.MutableEvaluationContext;
import org.nwapw.abacus.function.*;
import org.nwapw.abacus.number.NaiveNumber;
import org.nwapw.abacus.function.interfaces.NumberFunction;
import org.nwapw.abacus.function.interfaces.NumberOperator;
import org.nwapw.abacus.function.interfaces.TreeValueOperator;
import org.nwapw.abacus.number.standard.NaiveNumber;
import org.nwapw.abacus.number.NumberInterface;
import org.nwapw.abacus.number.PreciseNumber;
import org.nwapw.abacus.number.standard.PreciseNumber;
import org.nwapw.abacus.plugin.NumberImplementation;
import org.nwapw.abacus.plugin.Plugin;
import org.nwapw.abacus.plugin.PluginManager;