Skip to content

V2.3 #24

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
May 16, 2021
Merged

V2.3 #24

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f948b51
commit v2.3
lucafs May 16, 2021
3800f32
final 2.3
lucafs May 16, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
commit v2.3
  • Loading branch information
@lucafs
lucafs committed May 16, 2021
commit f948b5136d75b287636180c590c9775382580ea9
127 changes: 101 additions & 26 deletions main.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -33,6 +33,8 @@ def tToken_finder(char):
return "AND"
elif(char == "|"):
return "OR"
elif(char == '"'):
return "STRING"
elif(char.isalpha() or char == "-" or char == "_"):
return "IDENT"
elif(char.isdigit()):
Expand All @@ -52,18 +54,24 @@ def IdentType(char):
return "ELSE"
elif(char == "while"):
return "WHILE"

elif(char == "bool" or char == "int" or char == "string"):
return "TYPE"
elif(char == "true" or char == "false"):
return "BOOL"

class SymbolTable:

def __init__(self):
self.sym = {}

def setter(self, name, value):
self.sym[name] = value
def setter(self, name, value, type):
self.sym[name] = (value,type)

def getter(self, name):
return self.sym[name]
try:
return self.sym[name]
except:
raise Exception("Symbol "+name+ " not declared")


class Node():
Expand All @@ -80,30 +88,55 @@ def Evaluate(self,ST):

class IntVal(Node):
def Evaluate(self,ST):
return int(self.value)
return (int(self.value),"int")

class BoolVal(Node):
def Evaluate(self,ST):
if(self.value == "true"):
return (True,"bool")
else:
return (False,"bool")


class StringVal(Node):
def Evaluate(self,ST):
return (self.value,'string')


class UnOp(Node):
def Evaluate(self,ST):
if self.value == '+':
return self.children[0].Evaluate(ST)
return (self.children[0].Evaluate(ST)[0],"int")
else:
return -self.children[0].Evaluate(ST)
return (-self.children[0].Evaluate(ST)[0],"int")

class BinOP(Node):
def Evaluate(self,ST):
if(self.children[0].Evaluate(ST)[1] == "string" or self.children[0].Evaluate(ST)[1] == "string"):
raise Exception ("Can't make Arithmetic Operations with strings")
if (self.value=="+"):
return int(self.children[0].Evaluate(ST)) + int(self.children[1].Evaluate(ST))
return (int(self.children[0].Evaluate(ST)[0]) + int(self.children[1].Evaluate(ST)[0]),"int")
if (self.value=="-"):
return int(self.children[0].Evaluate(ST)) - int(self.children[1].Evaluate(ST))
return (int(self.children[0].Evaluate(ST)[0]) - int(self.children[1].Evaluate(ST)[0]),"int")
if (self.value=="*"):
return int(self.children[0].Evaluate(ST)) * int(self.children[1].Evaluate(ST))
return (int(self.children[0].Evaluate(ST)[0]) * int(self.children[1].Evaluate(ST)[0]),"int")
if (self.value=="/"):
return int(self.children[0].Evaluate(ST)) // int(self.children[1].Evaluate(ST))
return (int(self.children[0].Evaluate(ST)[0]) // int(self.children[1].Evaluate(ST)[0]),"int")

class FirstAssign(Node):
def Evaluate(self, ST):
type = self.children[0]
name = self.children[1]
ST.setter(name, None ,type)

class Assign(Node):
def Evaluate(self, ST):
expression = self.children[1].Evaluate(ST)
name = self.children[0].value
ST.setter(name, expression)
expression = self.children[1].Evaluate(ST)
type = ST.getter(name)[1]
if(expression[1] != type ):
raise Exception("Can't cast this variable")
ST.setter(name, expression[0],type)

class Identifier(Node):
def Evaluate(self, ST):
Expand All @@ -112,40 +145,45 @@ def Evaluate(self, ST):
class Println(Node):
def Evaluate(self, ST):
print_value = self.children[0].Evaluate(ST)
print(print_value)
if(print_value[1] == "string"):
print(print_value[0][1:-1])
else:
print(print_value[0])

class ReadLn(Node):
def Evaluate(self, ST):
return int(input())
return (int(input()),"int")

class LogOp(Node):

def Evaluate(self, ST):
if(self.children[0].Evaluate(ST)[1] == "string" or self.children[0].Evaluate(ST)[1] == "string"):
raise Exception ("Can't make Boolean Operations with strings")
if self.value == "<":
return self.children[0].Evaluate(ST) < self.children[1].Evaluate(ST)
return (self.children[0].Evaluate(ST)[0] < self.children[1].Evaluate(ST)[0],"bool")
elif self.value == ">":
return self.children[0].Evaluate(ST) > self.children[1].Evaluate(ST)
return (self.children[0].Evaluate(ST)[0] > self.children[1].Evaluate(ST)[0],"bool")
elif self.value == "==":
return self.children[0].Evaluate(ST) == self.children[1].Evaluate(ST)
return (self.children[0].Evaluate(ST)[0] == self.children[1].Evaluate(ST)[0],"bool")
elif self.value == "&&":
return self.children[0].Evaluate(ST) and self.children[1].Evaluate(ST)
elif self.value == "!":
return not self.children[0].Evaluate(ST)
return (self.children[0].Evaluate(ST)[0] and self.children[1].Evaluate(ST)[0],"bool")
elif self.value == "||":
return self.children[0].Evaluate(ST) or self.children[1].Evaluate(ST)
return (self.children[0].Evaluate(ST)[0] or self.children[1].Evaluate(ST)[0],"bool")
elif self.value == "!":
return (not self.children[0].Evaluate(ST)[0],"bool")#Não sei se é o certo


class WhileOp(Node):

def Evaluate(self, ST):
while (self.children[0].Evaluate(ST)):
while (self.children[0].Evaluate(ST)[0]):
self.children[1].Evaluate(ST)


class IfOp(Node):
def Evaluate(self, ST):
if (self.children[0].Evaluate(ST)):
self.children[1].Evaluate(ST)
if (self.children[0].Evaluate(ST)[0]):
self.children[1].Evaluate(ST)
else:
if len(self.children) > 2:
self.children[2].Evaluate(ST)
Expand Down Expand Up @@ -200,13 +238,23 @@ def selectNext(self):

self.actual = Token(tToken= tToken_finder(self.origin[self.position]),value = self.origin[self.position])
self.position += 1

if((self.position < len(self.origin)) and self.actual.type == "NUM"):
while(tToken_finder(self.origin[self.position]) == "NUM"):
self.actual.value += self.origin[self.position]
self.position += 1
if(self.position == len(self.origin)):
break


if((self.position < len(self.origin)) and self.actual.type == "STRING"):
while(tToken_finder(self.origin[self.position]) != "STRING"):
if(self.position == len(self.origin) or tToken_finder(self.origin[self.position]) == "ENDCOM"):
raise Exception ("ASPAS DE STRING NÃO FECHADAS")
self.actual.value += self.origin[self.position]
self.position += 1
self.actual.value += self.origin[self.position]
self.position += 1

if((self.position < len(self.origin)) and self.actual.type == "IDENT"):
while(tToken_finder(self.origin[self.position]) == "IDENT" or tToken_finder(self.origin[self.position]) == "NUM"):
self.actual.value += self.origin[self.position]
Expand Down Expand Up @@ -345,6 +393,16 @@ def parseFactor():
node = IntVal(res)
Parser.tokens.selectNext()
return node
elif(Parser.tokens.actual.type == "BOOL"):
res = Parser.tokens.actual.value
node = BoolVal(res)
Parser.tokens.selectNext()
return node
elif(Parser.tokens.actual.type == "STRING"):
res = Parser.tokens.actual.value
node = StringVal(res)
Parser.tokens.selectNext()
return node
elif(Parser.tokens.actual.type== "IDENT"):
node = Identifier()
node.value= Parser.tokens.actual.value
Expand Down Expand Up @@ -382,6 +440,7 @@ def parseFactor():
raise Exception("Read error")
return node
else:
print(Parser.tokens.actual.value)
raise Exception ("Factor error")


Expand Down Expand Up @@ -422,6 +481,22 @@ def parseCommand():

return assign

elif Parser.tokens.actual.type == "TYPE":
firstAssign = FirstAssign("=", [])
firstAssign.children.append(Parser.tokens.actual.value)
Parser.tokens.selectNext()
if(Parser.tokens.actual.type == "IDENT"):
firstAssign.children.append(Parser.tokens.actual.value)
Parser.tokens.selectNext()
if Parser.tokens.actual.type != "ENDCOM":
raise Exception("; NOT FOUND")
Parser.tokens.selectNext()
else:
raise Exception("FIRST ASSIGN ERROR")
return firstAssign




elif Parser.tokens.actual.type == "PRINT":
print_node = Println("PRINT", [])
Expand Down
12 changes: 10 additions & 2 deletions teste.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,13 @@
{
if (((1==1) || (1==1) || (1==1)) || ((1==0) && (1==0) && (1==0))){
println(1);
int x;
bool y;
bool h;
string hu;
hu = "dogdog";
h = false;
y = false;
if (h){
x = readln();
}
println(hu);
}