2012-04-09 10:42:06 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2012
|
|
|
|
* Dale Weiler
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy of
|
|
|
|
* this software and associated documentation files (the "Software"), to deal in
|
|
|
|
* the Software without restriction, including without limitation the rights to
|
|
|
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
|
|
|
|
* of the Software, and to permit persons to whom the Software is furnished to do
|
|
|
|
* so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
|
|
* copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
|
|
* SOFTWARE.
|
|
|
|
*/
|
|
|
|
#include <limits.h>
|
|
|
|
#include "gmqcc.h"
|
2012-04-09 11:45:20 +00:00
|
|
|
|
2012-04-09 14:14:26 +00:00
|
|
|
|
|
|
|
static const char *const parse_punct[] = {
|
|
|
|
"&&", "||", "<=", ">=", "==", "!=", ";", ",", "!", "*",
|
|
|
|
"/" , "(" , "-" , "+" , "=" , "[" , "]", "{", "}", "...",
|
|
|
|
"." , "<" , ">" , "#" , "&" , "|" , "$", "@", ":", NULL
|
|
|
|
/*
|
|
|
|
* $,@,: are extensions:
|
|
|
|
* $ is a shorter `self`, so instead of self.frags, $.frags
|
|
|
|
* @ is a constructor
|
|
|
|
* : is compiler builtin functions
|
|
|
|
*/
|
|
|
|
};
|
|
|
|
|
2012-04-09 10:42:06 +00:00
|
|
|
int parse(struct lex_file *file) {
|
|
|
|
int token = 0;
|
2012-04-09 13:36:16 +00:00
|
|
|
while ((token = lex_token(file)) != ERROR_LEX && \
|
|
|
|
token != ERROR_COMPILER && \
|
|
|
|
token != ERROR_INTERNAL && \
|
|
|
|
token != ERROR_PARSE && \
|
|
|
|
token != ERROR_PREPRO && file->length >= 0) {
|
2012-04-09 10:42:06 +00:00
|
|
|
switch (token) {
|
|
|
|
case TOKEN_IF:
|
|
|
|
token = lex_token(file);
|
|
|
|
while ((token == ' ' || token == '\n') && file->length >= 0)
|
|
|
|
token = lex_token(file);
|
|
|
|
|
|
|
|
if (token != '(')
|
|
|
|
error(ERROR_PARSE, "Expected `(` after if\n", "");
|
|
|
|
break;
|
2012-04-09 13:36:16 +00:00
|
|
|
|
|
|
|
/* TODO: Preprocessor */
|
|
|
|
case '#':
|
2012-04-09 14:14:26 +00:00
|
|
|
token = lex_token(file);
|
|
|
|
token = lex_token(file);
|
|
|
|
token = lex_token(file);
|
|
|
|
token = lex_token(file);
|
|
|
|
token = lex_token(file);
|
|
|
|
token = lex_token(file);
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* PUNCTUATION PARSING BEGINS */
|
|
|
|
case '&': /* & */
|
|
|
|
token = lex_token(file);
|
|
|
|
if (token == '&') { /* && */
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> LOGICAL AND\n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
printf("--> BITWISE AND\n");
|
|
|
|
break;
|
|
|
|
case '|': /* | */
|
|
|
|
token = lex_token(file);
|
|
|
|
if (token == '|') { /* || */
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> LOGICAL OR\n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
printf("--> BITWISE OR\n");
|
|
|
|
break;
|
|
|
|
case '!':
|
|
|
|
token = lex_token(file);
|
|
|
|
if (token == '=') { /* != */
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> LOGICAL NOT EQUAL\n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
printf("--> LOGICAL NOT\n");
|
|
|
|
break;
|
|
|
|
case '<': /* < */
|
|
|
|
token = lex_token(file);
|
|
|
|
if (token == '=') { /* <= */
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> LESS THAN OR EQUALL\n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
printf("--> LESS THAN\n");
|
|
|
|
break;
|
|
|
|
case '>': /* > */
|
|
|
|
token = lex_token(file);
|
|
|
|
if (token == '=') { /* >= */
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> GREATER THAN OR EQUAL\n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
printf("--> GREATER THAN\n");
|
|
|
|
break;
|
|
|
|
case '=':
|
|
|
|
token = lex_token(file);
|
|
|
|
if (token == '=') { /* == */
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> COMPARISION \n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
printf("--> ASSIGNMENT\n");
|
|
|
|
break;
|
|
|
|
case ';':
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> FINISHED STATMENT\n");
|
|
|
|
break;
|
|
|
|
case '-':
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> SUBTRACTION EXPRESSION\n");
|
|
|
|
break;
|
|
|
|
case '+':
|
|
|
|
token = lex_token(file);
|
|
|
|
printf("--> ASSIGNMENT EXPRRESSION\n");
|
|
|
|
break;
|
2012-04-09 10:42:06 +00:00
|
|
|
}
|
2012-04-09 14:14:26 +00:00
|
|
|
end:;
|
2012-04-09 10:42:06 +00:00
|
|
|
}
|
|
|
|
lex_reset(file);
|
|
|
|
|
2012-04-09 14:14:26 +00:00
|
|
|
// "&&", "||", "<=", ">=", "==", "!=", ";", ",", "!", "*",
|
|
|
|
//"/" , "(" , "-" , "+" , "=" , "[" , "]", "{", "}", "...",
|
|
|
|
//"." , "<" , ">" , "#" , "&" , "|" , "$", "@", ":", NULL
|
|
|
|
|
2012-04-09 10:42:06 +00:00
|
|
|
return 1;
|
|
|
|
}
|