Mercurial > hg > truffle
diff truffle/com.oracle.truffle.sl/src/com/oracle/truffle/sl/parser/Parser.java @ 21951:9c8c0937da41
Moving all sources into truffle subdirectory
author | Jaroslav Tulach <jaroslav.tulach@oracle.com> |
---|---|
date | Wed, 17 Jun 2015 10:58:08 +0200 |
parents | graal/com.oracle.truffle.sl/src/com/oracle/truffle/sl/parser/Parser.java@cfb85e1f4ca5 |
children | c07e64ecb528 |
line wrap: on
line diff
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/truffle/com.oracle.truffle.sl/src/com/oracle/truffle/sl/parser/Parser.java Wed Jun 17 10:58:08 2015 +0200 @@ -0,0 +1,546 @@ +/* + * Copyright (c) 2012, 2014, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. + * + * This code 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 + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +// The content of this file is automatically generated. DO NOT EDIT. + +package com.oracle.truffle.sl.parser; + +import java.util.*; + +import com.oracle.truffle.api.source.*; +import com.oracle.truffle.sl.*; +import com.oracle.truffle.sl.nodes.*; +import com.oracle.truffle.sl.runtime.*; + +// Checkstyle: stop +// @formatter:off +public class Parser { + public static final int _EOF = 0; + public static final int _identifier = 1; + public static final int _stringLiteral = 2; + public static final int _numericLiteral = 3; + public static final int maxT = 31; + + static final boolean _T = true; + static final boolean _x = false; + static final int minErrDist = 2; + + public Token t; // last recognized token + public Token la; // lookahead token + int errDist = minErrDist; + + public final Scanner scanner; + public final Errors errors; + private final SLNodeFactory factory; + + public Parser(SLContext context, Source source) { + this.scanner = new Scanner(source.getInputStream()); + this.factory = new SLNodeFactory(context, source); + errors = new Errors(); + } + + void SynErr(int n) { + if (errDist >= minErrDist) + errors.SynErr(la.line, la.col, n); + errDist = 0; + } + + public void SemErr(String msg) { + if (errDist >= minErrDist) + errors.SemErr(t.line, t.col, msg); + errDist = 0; + } + + void Get() { + for (;;) { + t = la; + la = scanner.Scan(); + if (la.kind <= maxT) { + ++errDist; + break; + } + + la = t; + } + } + + void Expect(int n) { + if (la.kind == n) + Get(); + else { + SynErr(n); + } + } + + boolean StartOf(int s) { + return set[s][la.kind]; + } + + void ExpectWeak(int n, int follow) { + if (la.kind == n) + Get(); + else { + SynErr(n); + while (!StartOf(follow)) + Get(); + } + } + + boolean WeakSeparator(int n, int syFol, int repFol) { + int kind = la.kind; + if (kind == n) { + Get(); + return true; + } else if (StartOf(repFol)) + return false; + else { + SynErr(n); + while (!(set[syFol][kind] || set[repFol][kind] || set[0][kind])) { + Get(); + kind = la.kind; + } + return StartOf(syFol); + } + } + + void SimpleLanguage() { + Function(); + while (la.kind == 4) { + Function(); + } + } + + void Function() { + Expect(4); + Expect(1); + Token identifierToken = t; + Expect(5); + int bodyStartPos = t.charPos; + factory.startFunction(identifierToken, bodyStartPos); + if (la.kind == 1) { + Get(); + factory.addFormalParameter(t); + while (la.kind == 6) { + Get(); + Expect(1); + factory.addFormalParameter(t); + } + } + Expect(7); + SLStatementNode body = Block(false); + factory.finishFunction(body); + } + + SLStatementNode Block(boolean inLoop) { + SLStatementNode result; + factory.startBlock(); + List<SLStatementNode> body = new ArrayList<>(); + Expect(8); + int start = t.charPos; + while (StartOf(1)) { + SLStatementNode s = Statement(inLoop); + body.add(s); + } + Expect(9); + int length = (t.charPos + t.val.length()) - start; + result = factory.finishBlock(body, start, length); + return result; + } + + SLStatementNode Statement(boolean inLoop) { + SLStatementNode result; + result = null; + switch (la.kind) { + case 13: { + result = WhileStatement(); + break; + } + case 10: { + Get(); + if (inLoop) { result = factory.createBreak(t); } else { SemErr("break used outside of loop"); } + Expect(11); + break; + } + case 12: { + Get(); + if (inLoop) { result = factory.createContinue(t); } else { SemErr("continue used outside of loop"); } + Expect(11); + break; + } + case 14: { + result = IfStatement(inLoop); + break; + } + case 16: { + result = ReturnStatement(); + break; + } + case 1: case 2: case 3: case 5: { + result = Expression(); + Expect(11); + break; + } + default: SynErr(32); break; + } + return result; + } + + SLStatementNode WhileStatement() { + SLStatementNode result; + Expect(13); + Token whileToken = t; + Expect(5); + SLExpressionNode condition = Expression(); + Expect(7); + SLStatementNode body = Block(true); + result = factory.createWhile(whileToken, condition, body); + return result; + } + + SLStatementNode IfStatement(boolean inLoop) { + SLStatementNode result; + Expect(14); + Token ifToken = t; + Expect(5); + SLExpressionNode condition = Expression(); + Expect(7); + SLStatementNode thenPart = Block(inLoop); + SLStatementNode elsePart = null; + if (la.kind == 15) { + Get(); + elsePart = Block(inLoop); + } + result = factory.createIf(ifToken, condition, thenPart, elsePart); + return result; + } + + SLStatementNode ReturnStatement() { + SLStatementNode result; + Expect(16); + Token returnToken = t; + SLExpressionNode value = null; + if (StartOf(2)) { + value = Expression(); + } + result = factory.createReturn(returnToken, value); + Expect(11); + return result; + } + + SLExpressionNode Expression() { + SLExpressionNode result; + result = LogicTerm(); + while (la.kind == 17) { + Get(); + Token op = t; + SLExpressionNode right = LogicTerm(); + result = factory.createBinary(op, result, right); + } + return result; + } + + SLExpressionNode LogicTerm() { + SLExpressionNode result; + result = LogicFactor(); + while (la.kind == 18) { + Get(); + Token op = t; + SLExpressionNode right = LogicFactor(); + result = factory.createBinary(op, result, right); + } + return result; + } + + SLExpressionNode LogicFactor() { + SLExpressionNode result; + result = Arithmetic(); + if (StartOf(3)) { + switch (la.kind) { + case 19: { + Get(); + break; + } + case 20: { + Get(); + break; + } + case 21: { + Get(); + break; + } + case 22: { + Get(); + break; + } + case 23: { + Get(); + break; + } + case 24: { + Get(); + break; + } + } + Token op = t; + SLExpressionNode right = Arithmetic(); + result = factory.createBinary(op, result, right); + } + return result; + } + + SLExpressionNode Arithmetic() { + SLExpressionNode result; + result = Term(); + while (la.kind == 25 || la.kind == 26) { + if (la.kind == 25) { + Get(); + } else { + Get(); + } + Token op = t; + SLExpressionNode right = Term(); + result = factory.createBinary(op, result, right); + } + return result; + } + + SLExpressionNode Term() { + SLExpressionNode result; + result = Factor(); + while (la.kind == 27 || la.kind == 28) { + if (la.kind == 27) { + Get(); + } else { + Get(); + } + Token op = t; + SLExpressionNode right = Factor(); + result = factory.createBinary(op, result, right); + } + return result; + } + + SLExpressionNode Factor() { + SLExpressionNode result; + result = null; + if (la.kind == 1) { + Get(); + if (la.kind == 5 || la.kind == 29 || la.kind == 30) { + result = MemberExpression(null, null, t); + } else if (StartOf(4)) { + result = factory.createRead(t); + } else SynErr(33); + } else if (la.kind == 2) { + Get(); + result = factory.createStringLiteral(t); + } else if (la.kind == 3) { + Get(); + result = factory.createNumericLiteral(t); + } else if (la.kind == 5) { + Get(); + int start = t.charPos; + result = Expression(); + SLExpressionNode expr = result; + Expect(7); + int length = (t.charPos + t.val.length()) - start; + result = factory.createParenExpression(expr, start, length); + } else SynErr(34); + return result; + } + + SLExpressionNode MemberExpression(SLExpressionNode r, SLExpressionNode assignmentReceiver, Token assignmentName) { + SLExpressionNode result; + result = null; + SLExpressionNode receiver = r; + Token nestedAssignmentName = null; + if (la.kind == 5) { + Get(); + List<SLExpressionNode> parameters = new ArrayList<>(); + SLExpressionNode parameter; + if (receiver == null) { + receiver = factory.createRead(assignmentName); + } + if (StartOf(2)) { + parameter = Expression(); + parameters.add(parameter); + while (la.kind == 6) { + Get(); + parameter = Expression(); + parameters.add(parameter); + } + } + Expect(7); + Token finalToken = t; + result = factory.createCall(receiver, parameters, finalToken); + } else if (la.kind == 29) { + Get(); + SLExpressionNode value = Expression(); + if (assignmentName == null) { + SemErr("invalid assignment target"); + } else if (assignmentReceiver == null) { + result = factory.createAssignment(assignmentName, value); + } else { + result = factory.createWriteProperty(assignmentReceiver, assignmentName, value); + } + } else if (la.kind == 30) { + Get(); + if (receiver == null) { + receiver = factory.createRead(assignmentName); + } + Expect(1); + result = factory.createReadProperty(receiver, t); + nestedAssignmentName = t; + } else SynErr(35); + if (la.kind == 5 || la.kind == 29 || la.kind == 30) { + result = MemberExpression(result, receiver, nestedAssignmentName); + } + return result; + } + + + + public void Parse() { + la = new Token(); + la.val = ""; + Get(); + SimpleLanguage(); + Expect(0); + + } + + private static final boolean[][] set = { + {_T,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x}, + {_x,_T,_T,_T, _x,_T,_x,_x, _x,_x,_T,_x, _T,_T,_T,_x, _T,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x}, + {_x,_T,_T,_T, _x,_T,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x}, + {_x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_x, _x,_x,_x,_T, _T,_T,_T,_T, _T,_x,_x,_x, _x,_x,_x,_x, _x}, + {_x,_x,_x,_x, _x,_T,_T,_T, _x,_x,_x,_T, _x,_x,_x,_x, _x,_T,_T,_T, _T,_T,_T,_T, _T,_T,_T,_T, _T,_T,_T,_x, _x} + + }; + + public static void parseSL(SLContext context, Source source) { + Parser parser = new Parser(context, source); + parser.Parse(); + if (parser.errors.errors.size() > 0) { + StringBuilder msg = new StringBuilder("Error(s) parsing script:\n"); + for (String error : parser.errors.errors) { + msg.append(error).append("\n"); + } + throw new SLException(msg.toString()); + } + } +} // end Parser + +class Errors { + + protected final List<String> errors = new ArrayList<>(); + public String errMsgFormat = "-- line {0} col {1}: {2}"; // 0=line, 1=column, 2=text + + protected void printMsg(int line, int column, String msg) { + StringBuffer b = new StringBuffer(errMsgFormat); + int pos = b.indexOf("{0}"); + if (pos >= 0) { + b.delete(pos, pos + 3); + b.insert(pos, line); + } + pos = b.indexOf("{1}"); + if (pos >= 0) { + b.delete(pos, pos + 3); + b.insert(pos, column); + } + pos = b.indexOf("{2}"); + if (pos >= 0) + b.replace(pos, pos + 3, msg); + errors.add(b.toString()); + } + + public void SynErr(int line, int col, int n) { + String s; + switch (n) { + case 0: s = "EOF expected"; break; + case 1: s = "identifier expected"; break; + case 2: s = "stringLiteral expected"; break; + case 3: s = "numericLiteral expected"; break; + case 4: s = "\"function\" expected"; break; + case 5: s = "\"(\" expected"; break; + case 6: s = "\",\" expected"; break; + case 7: s = "\")\" expected"; break; + case 8: s = "\"{\" expected"; break; + case 9: s = "\"}\" expected"; break; + case 10: s = "\"break\" expected"; break; + case 11: s = "\";\" expected"; break; + case 12: s = "\"continue\" expected"; break; + case 13: s = "\"while\" expected"; break; + case 14: s = "\"if\" expected"; break; + case 15: s = "\"else\" expected"; break; + case 16: s = "\"return\" expected"; break; + case 17: s = "\"||\" expected"; break; + case 18: s = "\"&&\" expected"; break; + case 19: s = "\"<\" expected"; break; + case 20: s = "\"<=\" expected"; break; + case 21: s = "\">\" expected"; break; + case 22: s = "\">=\" expected"; break; + case 23: s = "\"==\" expected"; break; + case 24: s = "\"!=\" expected"; break; + case 25: s = "\"+\" expected"; break; + case 26: s = "\"-\" expected"; break; + case 27: s = "\"*\" expected"; break; + case 28: s = "\"/\" expected"; break; + case 29: s = "\"=\" expected"; break; + case 30: s = "\".\" expected"; break; + case 31: s = "??? expected"; break; + case 32: s = "invalid Statement"; break; + case 33: s = "invalid Factor"; break; + case 34: s = "invalid Factor"; break; + case 35: s = "invalid MemberExpression"; break; + default: + s = "error " + n; + break; + } + printMsg(line, col, s); + } + + public void SemErr(int line, int col, String s) { + printMsg(line, col, s); + } + + public void SemErr(String s) { + errors.add(s); + } + + public void Warning(int line, int col, String s) { + printMsg(line, col, s); + } + + public void Warning(String s) { + errors.add(s); + } +} // Errors + +class FatalError extends RuntimeException { + + public static final long serialVersionUID = 1L; + + public FatalError(String s) { + super(s); + } +}