use of priv.bajdcc.util.lexer.error.RegexException in project jMiniLang by bajdcc.
the class TestGrammar method main.
public static void main(String[] args) {
try {
// String expr = "void main(int argc, char** argv) {return 0;}";
// BufferedReader br = new BufferedReader(new FileReader("E:/http.c"));
BufferedReader br = new BufferedReader(new FileReader("E:/a.c"));
String line;
StringBuilder sb = new StringBuilder();
while ((line = br.readLine()) != null) {
sb.append(line).append(System.lineSeparator());
}
br.close();
Grammar grammar = new Grammar(sb.toString());
// System.out.println(grammar.getNGAString());
System.out.println(grammar.getNPAString());
System.out.println(grammar.getInst());
System.out.println(grammar.getTrackerError());
System.out.println(grammar.getTokenList());
System.out.println(grammar.getObject());
// FileWriter fw = new FileWriter("E:/testgrammar.txt");
// fw.append(grammar.toString());
// fw.close();
} catch (RegexException e) {
System.err.println(e.getPosition() + "," + e.getMessage());
e.printStackTrace();
} catch (SyntaxException e) {
System.err.println(e.getPosition() + "," + e.getMessage() + " " + e.getInfo());
e.printStackTrace();
} catch (IOException e) {
System.err.println(e.getMessage());
e.printStackTrace();
}
}
use of priv.bajdcc.util.lexer.error.RegexException in project jMiniLang by bajdcc.
the class ModuleTask method util_calc.
private static String util_calc(String expr) {
try {
priv.bajdcc.OP.grammar.Grammar grammar = new priv.bajdcc.OP.grammar.Grammar(expr);
grammar.addTerminal("i", TokenType.INTEGER, null);
grammar.addTerminal("PLUS", TokenType.OPERATOR, OperatorType.PLUS);
grammar.addTerminal("MINUS", TokenType.OPERATOR, OperatorType.MINUS);
grammar.addTerminal("TIMES", TokenType.OPERATOR, OperatorType.TIMES);
grammar.addTerminal("DIVIDE", TokenType.OPERATOR, OperatorType.DIVIDE);
grammar.addTerminal("LPA", TokenType.OPERATOR, OperatorType.LPARAN);
grammar.addTerminal("RPA", TokenType.OPERATOR, OperatorType.RPARAN);
String[] nons = new String[] { "E", "T", "F" };
for (String non : nons) {
grammar.addNonTerminal(non);
}
grammar.addPatternHandler("1", new IPatternHandler() {
@Override
public Object handle(List<Token> tokens, List<Object> symbols) {
return Integer.parseInt(tokens.get(0).object.toString());
}
@Override
public String getPatternName() {
return "操作数转换";
}
});
grammar.addPatternHandler("010", new IPatternHandler() {
@Override
public Object handle(List<Token> tokens, List<Object> symbols) {
int lop = (int) symbols.get(0);
int rop = (int) symbols.get(1);
Token op = tokens.get(0);
if (op.kToken == TokenType.OPERATOR) {
OperatorType kop = (OperatorType) op.object;
switch(kop) {
case PLUS:
return lop + rop;
case MINUS:
return lop - rop;
case TIMES:
return lop * rop;
case DIVIDE:
if (rop == 0) {
return lop;
} else {
return lop / rop;
}
default:
return 0;
}
} else {
return 0;
}
}
@Override
public String getPatternName() {
return "二元运算";
}
});
grammar.addPatternHandler("101", new IPatternHandler() {
@Override
public Object handle(List<Token> tokens, List<Object> symbols) {
Token ltok = tokens.get(0);
Token rtok = tokens.get(1);
Object exp = symbols.get(0);
if (ltok.object == OperatorType.LPARAN && rtok.object == OperatorType.RPARAN) {
// 判断括号
return exp;
}
return null;
}
@Override
public String getPatternName() {
return "括号运算";
}
});
grammar.infer("E -> E @PLUS T | E @MINUS T | T");
grammar.infer("T -> T @TIMES F | T @DIVIDE F | F");
grammar.infer("F -> @LPA E @RPA | @i");
grammar.initialize("E");
return String.valueOf(grammar.run());
} catch (RegexException e) {
logger.error("#CALC# Error: " + e.getPosition() + "," + e.getMessage());
} catch (SyntaxException e) {
logger.error("#CALC#Error: " + e.getPosition() + "," + e.getMessage() + " " + e.getInfo());
} catch (GrammarException e) {
logger.error("#CALC#Error: " + e.getPosition() + "," + e.getMessage() + " " + e.getInfo());
}
return "#CALC#Error";
}
use of priv.bajdcc.util.lexer.error.RegexException in project jMiniLang by bajdcc.
the class TestOperator method main.
public static void main(String[] args) {
// System.out.println("Z -> `a`<,> | B | [`a` `b` Z B]");
try {
// Scanner scanner = new Scanner(System.in);
// String expr = "( i )";
// String expr = "((3))+4*5+66/(3-8)";
// String expr = "(4 * 7 - 13) * (3 + 18 / 3 - 3)";
String expr = "(5 + 5)";
Semantic semantic = new Semantic(expr);
semantic.addTerminal("PLUS", TokenType.OPERATOR, OperatorType.PLUS);
semantic.addTerminal("MINUS", TokenType.OPERATOR, OperatorType.MINUS);
semantic.addTerminal("TIMES", TokenType.OPERATOR, OperatorType.TIMES);
semantic.addTerminal("DIVIDE", TokenType.OPERATOR, OperatorType.DIVIDE);
semantic.addTerminal("LPA", TokenType.OPERATOR, OperatorType.LPARAN);
semantic.addTerminal("RPA", TokenType.OPERATOR, OperatorType.RPARAN);
semantic.addTerminal("INTEGER", TokenType.INTEGER, null);
semantic.addNonTerminal("Z");
semantic.addNonTerminal("E");
semantic.addNonTerminal("T");
semantic.addNonTerminal("F");
semantic.addActionHandler("enter_paran", (indexed, manage, access, recorder) -> System.out.println("enter"));
semantic.addActionHandler("leave_paran", (indexed, manage, access, recorder) -> System.out.println("leave"));
semantic.addErrorHandler("lost_exp", (iterator, bag) -> {
bag.bRead = false;
bag.bPass = true;
return "表达式不完整";
});
semantic.addErrorHandler("lost_exp_right", (iterator, bag) -> {
bag.bRead = false;
bag.bPass = true;
return "缺少右括号";
});
ISemanticAnalyzer handleCopy = (indexed, query, recorder) -> indexed.get(0).object;
ISemanticAnalyzer handleBinop = (indexed, query, recorder) -> {
int lop = Integer.parseInt(indexed.get(0).object.toString());
int rop = Integer.parseInt(indexed.get(2).object.toString());
Token op = indexed.get(1).token;
if (op.kToken == TokenType.OPERATOR) {
OperatorType kop = (OperatorType) op.object;
switch(kop) {
case PLUS:
return lop + rop;
case MINUS:
return lop - rop;
case TIMES:
return lop * rop;
case DIVIDE:
if (rop == 0) {
return lop;
} else {
return lop / rop;
}
default:
return 0;
}
} else {
return 0;
}
};
ISemanticAnalyzer handleValue = (indexed, query, recorder) -> indexed.get(0).token.object;
// syntax.infer("E -> T `PLUS`<+> E | T `MINUS`<-> E | T");
// syntax.infer("T -> F `TIMES`<*> T | F `DIVIDE`</> T | F");
// syntax.infer("F -> `LPA`<(> E `RPA`<)> | `SYMBOL`<i>");
semantic.infer(handleCopy, "Z -> E[0]");
semantic.infer(handleCopy, "E -> T[0]");
semantic.infer(handleBinop, "E -> E[0] ( @PLUS[1]<+> | @MINUS[1]<-> ) T[2]{lost_exp}");
semantic.infer(handleCopy, "T -> F[0]");
semantic.infer(handleBinop, "T -> T[0] ( @TIMES[1]<*> | @DIVIDE[1]</> ) F[2]{lost_exp}");
semantic.infer(handleValue, "F -> @INTEGER[0]<integer>");
semantic.infer(handleCopy, "F -> @LPA#enter_paran#<(> E[0]{lost_exp} @RPA#leave_paran#{lost_exp_right}<)>");
semantic.initialize("Z");
// System.out.println(semantic.toString());
// System.out.println(semantic.getNGAString());
// System.out.println(semantic.getNPAString());
// System.out.println(semantic.getInst());
System.out.println(semantic.getTrackerError());
System.out.println(semantic.getTokenList());
System.out.println(semantic.getObject());
// scanner.close();
} catch (RegexException e) {
System.err.println(e.getPosition() + "," + e.getMessage());
e.printStackTrace();
} catch (SyntaxException e) {
System.err.println(e.getPosition() + "," + e.getMessage() + " " + e.getInfo());
e.printStackTrace();
}
}
use of priv.bajdcc.util.lexer.error.RegexException in project jMiniLang by bajdcc.
the class TestSemantic method main.
public static void main(String[] args) {
// System.out.println("Z -> `a`<,> | B | [`a` `b` Z B]");
try {
// Scanner scanner = new Scanner(System.in);
// String expr = "( i )";
String expr = "((i))+i*i+i/(i-i)";
Semantic semantic = new Semantic(expr);
semantic.addTerminal("PLUS", TokenType.OPERATOR, OperatorType.PLUS);
semantic.addTerminal("MINUS", TokenType.OPERATOR, OperatorType.MINUS);
semantic.addTerminal("TIMES", TokenType.OPERATOR, OperatorType.TIMES);
semantic.addTerminal("DIVIDE", TokenType.OPERATOR, OperatorType.DIVIDE);
semantic.addTerminal("LPA", TokenType.OPERATOR, OperatorType.LPARAN);
semantic.addTerminal("RPA", TokenType.OPERATOR, OperatorType.RPARAN);
semantic.addTerminal("SYMBOL", TokenType.ID, "i");
semantic.addNonTerminal("Z");
semantic.addNonTerminal("E");
semantic.addNonTerminal("T");
semantic.addNonTerminal("F");
semantic.addErrorHandler("sample", null);
// syntax.infer("E -> T `PLUS`<+> E | T `MINUS`<-> E | T");
// syntax.infer("T -> F `TIMES`<*> T | F `DIVIDE`</> T | F");
// syntax.infer("F -> `LPA`<(> E `RPA`<)> | `SYMBOL`<i>");
semantic.infer("Z -> E");
semantic.infer("E -> T");
semantic.infer("E -> E @PLUS<+> T");
semantic.infer("E -> E @MINUS<-> T");
semantic.infer("T -> F");
semantic.infer("T -> T @TIMES<*> F");
semantic.infer("T -> T @DIVIDE</> F");
semantic.infer("F -> @SYMBOL<i>");
semantic.infer("F -> @LPA<(> E @RPA<)>");
semantic.initialize("Z");
System.out.println(semantic.toString());
System.out.println(semantic.getNGAString());
System.out.println(semantic.getNPAString());
System.out.println(semantic.getInst());
System.out.println(semantic.getTrackerError());
System.out.println(semantic.getTokenList());
// scanner.close();
} catch (RegexException e) {
System.err.println(e.getPosition() + "," + e.getMessage());
e.printStackTrace();
} catch (SyntaxException e) {
System.err.println(e.getPosition() + "," + e.getMessage() + " " + e.getInfo());
e.printStackTrace();
}
}
use of priv.bajdcc.util.lexer.error.RegexException in project jMiniLang by bajdcc.
the class TestSemantic3 method main.
public static void main(String[] args) {
// System.out.println("Z -> `a`<,> | B | [`a` `b` Z B]");
try {
// Scanner scanner = new Scanner(System.in);
// String expr = "( i )";
String expr = "a a a a";
Semantic semantic = new Semantic(expr);
semantic.addTerminal("a", TokenType.ID, "a");
semantic.addNonTerminal("START");
semantic.addNonTerminal("Z");
semantic.addErrorHandler("sample", null);
ISemanticAnalyzer handleValue = (indexed, query, recorder) -> 1;
ISemanticAnalyzer handleCopy = (indexed, query, recorder) -> indexed.get(0).object;
ISemanticAnalyzer handleRec = (indexed, query, recorder) -> {
int lop = Integer.parseInt(indexed.get(0).object.toString());
return lop + 1;
};
// syntax.infer("E -> T `PLUS`<+> E | T `MINUS`<-> E | T");
// syntax.infer("T -> F `TIMES`<*> T | F `DIVIDE`</> T | F");
// syntax.infer("F -> `LPA`<(> E `RPA`<)> | `SYMBOL`<i>");
semantic.infer(handleCopy, "START -> Z[0]");
semantic.infer(handleRec, "Z -> Z[0] @a[1]");
semantic.infer(handleValue, "Z -> @a[0]");
semantic.initialize("START");
System.out.println(semantic.toString());
System.out.println(semantic.getNGAString());
System.out.println(semantic.getNPAString());
System.out.println(semantic.getInst());
System.out.println(semantic.getTrackerError());
System.out.println(semantic.getTokenList());
System.out.println(semantic.getObject());
// scanner.close();
} catch (RegexException e) {
System.err.println(e.getPosition() + "," + e.getMessage());
e.printStackTrace();
} catch (SyntaxException e) {
System.err.println(e.getPosition() + "," + e.getMessage() + " " + e.getInfo());
e.printStackTrace();
}
}
Aggregations