Acceptable Parser Version

README.md

@@ -37,6 +37,7 @@
 
 # problemas
 
+- [ ] Descartar metodo descendente recursivo? Utilizar metodo de tabela descrevendo as regras de sintaxe?
 - [ ] Output colorido em testes
 - [ ] Todo ID deve ser checado pelo parser se é reservado?
 - [ ] Refactor indispensável no parser: remover erros que não serão usados

debug.c

@@ -21,7 +21,7 @@ int main(int argc, char *argv[]) {
   FILE *fd;
   int lineCount = 1;
 
-  fd = fopen("./doc/examples/code.proc", "r");
+  fd = fopen("./doc/examples/fatrec.proc", "r");
   if (fd == NULL) {
     fprintf(stderr, "Error opening file\n");
     return EXIT_FAILURE;
@@ -51,7 +51,7 @@ int main(int argc, char *argv[]) {
   int line = 1;
   lc = &line;
 
-  fd = fopen("./doc/examples/code.proc", "r");
+  fd = fopen("./doc/examples/fatrec.proc", "r");
   if (fd == NULL) {
     fprintf(stderr, "Error opening file\n");
     return EXIT_FAILURE;

doc/examples/code.proc

@@ -1 +1,9 @@
-prot a -
+// calcular fatorial recursivo 
+
+def fatorial(&int f, int n) 
+    if (n <= 1) f = 1 
+    else 
+        do fatorial(f, n-1) 
+        f = f*n 
+    endi 
+endp 

doc/examples/fat.proc

@@ -0,0 +1,17 @@
+// Calcular fatorial iterativo
+
+def init()
+	int fat = 1, n = 1, z
+	getint n
+	if (n <= 1)
+		fat = 1
+	else
+		fat = n
+		z = n
+		while (z > 2)
+			z = z - 1
+			fat = fat * z
+		endw
+	endi
+	putint fat
+endp

doc/examples/fatrec.proc

@@ -0,0 +1,16 @@
+// calcular fatorial recursivo 
+
+prot fatorial (&int, int) 
+def init()
+    int n, fat 
+    getint n 
+    do fatorial(fat, n) 
+    putint fat 
+endp 
+def fatorial(&int f, int n) 
+    if (n <= 1) f = 1 
+    else 
+        do fatorial(f, n-1) 
+        f = f*n 
+    endi 
+endp 

lexer/lexer.c

@@ -116,7 +116,7 @@ struct Token lexerGetNextChar(FILE *fd, int *lineCount) {
       // State 30: accepting
       {},
       // State 31
-      {{32, isRef, SIGN, NOT_OTHER, REF}, {33, isNotRef, SIGN, IS_OTHER, AND}},
+      {{32, isRef, SIGN, NOT_OTHER, AND}, {33, isNotRef, SIGN, IS_OTHER, REF}},
       // State 32: accepting
       {},
       // State 33: accepting