clara/lcc
1
0
Fork 0
Code Issues 1 Pull requests Projects Releases Packages Wiki Activity Actions

lexing and parsing unary operators

Browse source
This commit is contained in:
Clemens-Dautermann 2020-08-20 17:11:43 +02:00
parent b2c2a2f497
commit 202c1d2ca2
21 changed files with 290 additions and 130 deletions
Download patch file Download diff file Expand all files Collapse all files

3
Compiler/Parser/Nodes/NodeType.cs
View file

@ -5,6 +5,7 @@ namespace Compiler.Parser.Nodes
ProgramNode,
FunctionNode,
ReturnStatementNode,
ExpressionNode
ExpressionNode,
}
}

10
Compiler/Parser/Nodes/OperatorType.cs Normal file
View file

@ -0,0 +1,10 @@
namespace Compiler.Parser.Nodes
{
public enum OperatorType
{
//unary operators
Negation,
BitwiseComplement,
LogicalNegation,
}
}

14
Compiler/Parser/Nodes/UnaryOperatorNode.cs Normal file
View file

@ -0,0 +1,14 @@
namespace Compiler.Parser.Nodes
{
public sealed class UnaryOperatorNode : Node
{
public override NodeType NodeType { get; set; }
public OperatorType OperatorType { get; set; }
public UnaryOperatorNode(OperatorType operatorType)
{
OperatorType = operatorType;
NodeType = NodeType.ExpressionNode;
}
}
}

57
Compiler/Parser/Parser.cs
View file

@ -112,26 +112,51 @@ namespace Compiler.Parser
throw new MissingTokenException(TokenType.IntegerLiteralToken);
}
Token constantToken = _tokenList[0];
Token expressionToken = _tokenList[0];
//check if TokenType is right
if (constantToken.TokenType != TokenType.IntegerLiteralToken)
//the next token might be a constant or any operator
switch (expressionToken.TokenType)
{
throw new UnexpectedTokenException(TokenType.IntToken, constantToken.TokenType);
}
else
{
//remove int literal token
_tokenList.RemoveAt(0);
case TokenType.IntegerLiteralToken:
//remove int literal token
_tokenList.RemoveAt(0);
//check if value Type is right
if (constantToken.Value.GetType() != typeof(int))
{
throw new WrongTypeException(typeof(int), constantToken.Value.GetType());
}
//check if value Type is right
if (expressionToken.Value.GetType() != typeof(int))
{
throw new WrongTypeException(typeof(int), expressionToken.Value.GetType());
}
//return final constant node to end recursion
n = new ConstantNode((int) constantToken.Value);
//return final constant node to end recursion
n = new ConstantNode((int) expressionToken.Value);
break;
case TokenType.NegationToken:
_tokenList.RemoveAt(0);
n = new UnaryOperatorNode(OperatorType.Negation);
n.Children.Add(Parse(NodeType.ExpressionNode));
break;
case TokenType.BitwiseComplementToken:
_tokenList.RemoveAt(0);
n = new UnaryOperatorNode(OperatorType.BitwiseComplement);
n.Children.Add(Parse(NodeType.ExpressionNode));
break;
case TokenType.LogicalNegationToken:
_tokenList.RemoveAt(0);
n = new UnaryOperatorNode(OperatorType.LogicalNegation);
n.Children.Add(Parse(NodeType.ExpressionNode));
break;
case TokenType.IntToken:
case TokenType.OpenParenthesisToken:
case TokenType.CloseParenthesisToken:
case TokenType.OpenBraceToken:
case TokenType.CloseBraceToken:
case TokenType.ReturnToken:
case TokenType.SemicolonToken:
case TokenType.IdentifierToken:
case TokenType.InvalidToken:
throw new UnexpectedTokenException(TokenType.IntToken, expressionToken.TokenType);
default:
throw new UnexpectedTokenException(TokenType.IntToken, expressionToken.TokenType);
}
break;