using System; using System.Collections.Generic; using System.Linq; using Compiler.Lexer; using Compiler.Parser.Exceptions; using Compiler.Parser.Nodes; namespace Compiler.Parser { public class Parser { private readonly List _tokenList; public Parser(List tokenList) { _tokenList = tokenList; } private void CheckFirstTokenAndRemove(TokenType expected) { if (_tokenList.Count == 0) { throw new MissingTokenException(expected); } if (_tokenList[0].TokenType != expected) { throw new UnexpectedTokenException(expected, _tokenList[0].TokenType); } _tokenList.RemoveAt(0); } public Node Parse(NodeType nodeType) { Node n; switch (nodeType) { case NodeType.ProgramNode: n = new ProgramNode(); //if this node is a program node, the next one must be a function node Node childNode = Parse(NodeType.FunctionNode); n.Children.Add(childNode); break; case NodeType.FunctionNode: n = new FunctionNode(); //check each element of the signature and raise corresponding errors CheckFirstTokenAndRemove(TokenType.IntToken); if (_tokenList.Count == 0) { throw new MissingTokenException(TokenType.IdentifierToken); } if (_tokenList[0].Value != null) { if (_tokenList[0].TokenType == TokenType.IdentifierToken) { ((FunctionNode) n).Name = _tokenList[0].Value.ToString(); } else { throw new UnexpectedTokenException(TokenType.IdentifierToken, _tokenList[0].TokenType); } } else { throw new InvalidIdentifierException(null); } //remove _tokenList.RemoveAt(0); CheckFirstTokenAndRemove(TokenType.OpenParenthesisToken); CheckFirstTokenAndRemove(TokenType.CloseParenthesisToken); CheckFirstTokenAndRemove(TokenType.OpenBraceToken); //add returned child node to AST n.Children.Add(Parse(NodeType.ReturnStatementNode)); //remove trailing } CheckFirstTokenAndRemove(TokenType.CloseBraceToken); break; case NodeType.ReturnStatementNode: //TODO: This Type of return/statement node will probably need fixing later n = new ReturnNode(); //get return token and remove it CheckFirstTokenAndRemove(TokenType.ReturnToken); //add returned child node to AST n.Children.Add(Parse(NodeType.ExpressionNode)); //remove trailing ; CheckFirstTokenAndRemove(TokenType.SemicolonToken); break; case NodeType.ExpressionNode: if (_tokenList.Count == 0) { throw new MissingTokenException(TokenType.IntegerLiteralToken); } Token expressionToken = _tokenList[0]; switch (expressionToken.TokenType) { case TokenType.IntegerLiteralToken: n = Parse(NodeType.ConstantNode); break; case TokenType.BitwiseComplementToken: case TokenType.NegationToken: case TokenType.LogicalNegationToken: n = Parse(NodeType.UnaryOperatorNode); break; default: throw new UnexpectedTokenException(TokenType.IntegerLiteralToken, expressionToken.TokenType); } break; case NodeType.UnaryOperatorNode: if (_tokenList.Count == 0) { throw new MissingTokenException(TokenType.IntegerLiteralToken); } else { Token unaryOperator = _tokenList[0]; _tokenList.RemoveAt(0); switch (unaryOperator.TokenType) { case TokenType.BitwiseComplementToken: n = new UnaryOperatorNode(OperatorType.BitwiseComplement); n.Children.Add(Parse(NodeType.ExpressionNode)); break; case TokenType.NegationToken: n = new UnaryOperatorNode(OperatorType.Negation); n.Children.Add(Parse(NodeType.ExpressionNode)); break; case TokenType.LogicalNegationToken: n = new UnaryOperatorNode(OperatorType.LogicalNegation); n.Children.Add(Parse(NodeType.ExpressionNode)); break; default: throw new UnexpectedTokenException(TokenType.IntegerLiteralToken, unaryOperator.TokenType); } } break; case NodeType.ConstantNode: if (_tokenList.Count == 0) { throw new MissingTokenException(TokenType.IntegerLiteralToken); } //double check, for safety. Pbly unnecesarry if (_tokenList[0].TokenType != TokenType.IntegerLiteralToken) { throw new UnexpectedTokenException(TokenType.IntegerLiteralToken, _tokenList[0].TokenType); } else { //return final constant node to end recursion n = new ConstantNode((int) _tokenList[0].Value); _tokenList.RemoveAt(0); break; } default: throw new Exception("Unknown Node Type " + nodeType); } return n; } } }