Nettoyage

This commit is contained in:
Shadow 2020-06-03 08:47:59 +02:00
parent 4a148b91c6
commit 7f69960859
1 changed files with 0 additions and 190 deletions

View File

@ -1,190 +0,0 @@
# --------------------------------------------------
# Compylateur (Version dev)
# By Sha-Chan~ 
# from April to June 2020
#
# Code provided with licence (CC BY-NC-ND 4.0)
# For more informations about licence :
# https://creativecommons.org/licenses/by-nc-nd/4.0/
# --------------------------------------------------
# ==================================================
# Objects code
# ==================================================
# --- Tokens --- #
class Token():
def __init__(self, token_type = "", token_value = ""):
self.type = token_type
self.value = token_value
class TokenList():
def __init__(self):
self.index = -1
self.list = list()
def add(self, token):
self.list.append(token)
def next(self, jump = 1):
self.index += jump
if self.index < len(self.list):
return self.list[self.index]
else:
return self.list[-1]
def generate(self):
for i in self.list: print((i.type, i.value))
# --- Abstract Syntax Tree (AST) --- #
class AST():
def __init__(self):
self.branch = list()
def add_branch(self, branch):
self.branch.append(branch)
class Branch():
def __init__(self, title, value, *sub_branch):
self.title = title
self.value = value
self.sub_branch = list(sub_branch)
def add_sub_branch(self, *sub_branch):
for i in sub_branch: self.sub_branch.append(i)
def gen(self):
return self.title, self.value, self.sub_branch
def AST_gen(branch, tab = 0):
for i in branch:
print(tab * " " + "{0} : {1}".format(i.gen()[0], i.gen()[1]))
if i.gen()[2]: AST_gen(i.gen()[2], tab + 1)
# --- Parser --- #
class Parser():
def __init__(self, l_token):
self.l_token = l_token
self.token_watch = Token()
def read(self, target = []):
self.token_watch = self.l_token.next()
if target != [] and self.token_watch.type not in target:
raise SyntaxError("This operand was not expected : '{0}'".format(self.token_watch.value))
return self.token_watch
def atome(self):
return self.read(["VAR", "NUM"])
# ==================================================
# Lexer
# ==================================================
# --- Main function --- #
def lexer(prgm_src):
var_type = {"des réels", "un réel", "des entiers", "un entiers", "un entier naturel", "des entiers naturels", "un entier relatif", "des entiers relatifs", "une liste", "des listes", "un flottant", "des flottants", "une chaîne de caractères", "des chaînes de caractères"}
cmnd = {"fin", "finsi", "fin si", "fintantque", "fin tantque", "fin tant que", "finpour", "fin pour", "afficher", "si", "alors", "sinon", "tant que", "tantque", "pour"}
optr = {"+", "-", "/", "*", "^"}
sptr = {"et", "(", ")", "[", "]", "{", "}", "\n", "à", "entre", "de", ",", ";", "faire"}
comp = {"=", "<", "<=", ">", ">=", "est supérieur à", "est supérieur ou égal à", "est inférieur à", "est inférieur ou égal à", "est différent de", "est égal à"}
user = {"saisir", "saisir la valeur de", "saisir les valeurs de", "demander la valeur de", "demander à l'utilisateur la valeur de"}
logi = {"et que", "ou que"}
assi = {"prend la valeur", "sont", "est"}
rang = {"allant", "variant"}
for i in {"=", "<", "<=", ">", ">=", "+", "-", "/", "*", "^", "(", ")", "[", "]", "{", "}", '"', "\n", ",", ";"}:
prgm_src = prgm_src.replace(i, " " + i + " ")
word = [i for i in prgm_src.lower().split(" ") if i != ""]
l_token = TokenList()
index, undef = 0, bool()
token = (var_type, cmnd, optr, comp, user, logi, assi, sptr, rang)
name = ("TYPE", "CMND", "OPTR", "COMP", "USER", "LOGI", "ASSI", "SPTR", "RANG")
while True:
undef = True
for j in range(len(token)):
for k in token[j]:
target = k.split(" ")
if index >= len(word): return l_token
if word[index] in target and lexer_detect(word, index, target):
l_token.add(Token(name[j], k))
undef = False
index += len(target)
if undef and word[index] == "\"":
l_token, index = text_detecter(word, index, l_token)
elif undef:
l_token.add(Token(("VAR", "NUM")[word[index].isdigit()], word[index]))
index += 1
# --- Secondary functions --- #
def lexer_detect(word, index, target):
try:
return not 0 in [target[i] == word[i + index] for i in range(len(target))]
except:
return 0
def text_detecter(word, index, l_token):
txt = word[index]
index += 1
while word[index] != '"':
txt = txt + " " + word[index]
index += 1
l_token.add(Token("TEXT", txt + ' "'))
return l_token, index + 1
# ==================================================
# Parser
# ==================================================
# --- Main function --- #
def parser(l_token):
parser = Parser(l_token)
ast = AST()
ast.add_branch(somme(parser))
return ast
# --- Grammar detection functions --- #
# (only test functions for the moment)
def somme(parser):
atome_1 = parser.atome()
parser.read(["OPTR"])
if parser.token_watch.value == "+":
atome_2 = parser.atome()
return Branch("Operation", "+", Branch(("Variable", "Number")[atome_1.value.isdigit()], atome_1.value), Branch(("Variable", "Number")[atome_2.value.isdigit()], atome_2.value))
# --- Secondary functions --- #
# (empty for the moment)
# ==================================================
# Miscellaneous functions
# ==================================================
def compylateur(code):
l_token = lexer(code)
print("--- Tokens ---")
l_token.generate()
print("\n\n--- AST ---")
ast = parser(l_token)
AST_gen(ast.branch)