bool_t.h

#pragma once

typedef enum
{   
False,
True
}bool_t;
 

Comments

Post a Comment

Popular posts from this blog

parser_experimental.cpp

 #include "tape_t.h" #include "string_t.h" #include "CLexer.h" #include "tree.h" #include <iostream> int main(int argc, char* argv[]) { char* tape = {}; TreeNode* expr; int t = 0; tape = (char*)calloc(1, sizeof(char)); const char* loc = "C:\\MyWork\\prat.c"; tape_read((char*)loc, &tape); int file_length; string_t str = string_file(tape, &file_length); //const char *tape2 = "i++ + ++i;"; //string_t str = string((char*)tape2); //string_t meta = string("\0"); tokenizer(str); init_tokenizer(str); /*for (i = 0; t != EOF;) { printf("Returned token is:%d\n", t = getTokenByPos(str, &i)); } */ if ((expr = expression()) != NULL) { printf("It is an expression() !"); free(expr); } free(tape); //  printf("entire file length is :%d\n", file_length); return 0; }
Read more

tape_t.h

 #pragma once #include <stdlib.h> #include <stdio.h> enum Bool { FALSE, TRUE }; char getch(char* Tape, int current_ptr) { return Tape[current_ptr]; } char getchIncr(char* Tape, int current_ptr) { return Tape[current_ptr++]; } int tapeIncr(int current_ptr, int i) { current_ptr += i; return current_ptr; } void necessary_expect(char* Tape, int current_ptr, char expected_symbol) { if (getch(Tape, current_ptr) != expected_symbol) { printf("Missing char is %c but input char is (%c)%d\n", expected_symbol, getch(Tape, current_ptr), getch(Tape, current_ptr)); exit(0); } current_ptr++; } Bool optional_expect(char* Tape, int current_ptr, char expected_symbol) { if (getch(Tape, current_ptr) != expected_symbol) { return FALSE; } current_ptr++; return TRUE; } void jumpline(char* Tape, int current_ptr) { if (getch(Tape, current_ptr) == '\n') { current_ptr++; return; } while (getch(Tape, current_ptr) != '\n') ...
Read more

tree.cpp

 #include <stdlib.h> #include "tree.h" TreeNode* newStmtNode(StmtType tp) {     int i;     TreeNode* t = (TreeNode*)malloc(sizeof(TreeNode));     for (i = 0; i < MAX_CHILD;i++)     {         t->child[i] = NULL;     }     t->Type.stmt = tp;     t->nodeType = Stmt;     // Future addition needed     return t; } TreeNode* newExpNode(ExpType tp) {     int i;     TreeNode* t = (TreeNode*)malloc(sizeof(TreeNode));     for (i = 0; i < MAX_CHILD; i++)     {         t->child[i] = NULL;     }     t->Type.exp = tp;     t->nodeType = Expr;     // Future addition needed     return t; }
Read more