From 4923bb2bb815971ae66c7b042c2f98bd6dd04f8a Mon Sep 17 00:00:00 2001 From: "Ryan C. Gordon" Date: Tue, 9 Feb 2010 02:55:38 -0500 Subject: [PATCH] Moved the calculator experiment work back into the compiler. At least we know the expression parser works! :) Lots of other bits of new infrastructure in there, too. --HG-- branch : calculator-experiment --- mojoshader_compiler.c | 495 ++++++++++++++++++++++++++++++++--- mojoshader_parser_hlsl.lemon | 256 +++++++++--------- 2 files changed, 592 insertions(+), 159 deletions(-) diff --git a/mojoshader_compiler.c b/mojoshader_compiler.c index 384da4dd..298845e7 100644 --- a/mojoshader_compiler.c +++ b/mojoshader_compiler.c @@ -5,46 +5,327 @@ #define LEMON_SUPPORT_TRACING 1 #endif -typedef struct TokenData +typedef union TokenData { - const char *token; - unsigned int tokenlen; + int64 i64; + double dbl; + const char *string; } TokenData; +typedef struct StringBucket +{ + char *string; + struct StringBucket *next; +} StringBucket; + typedef struct Context { + int isfail; + int out_of_memory; + MOJOSHADER_malloc malloc; + MOJOSHADER_free free; + void *malloc_data; + int error_count; + ErrorList *errors; Preprocessor *preprocessor; - const char *token; - unsigned int tokenlen; - Token tokenval; - unsigned int parse_errors; - TokenData usertypes[512]; // !!! FIXME: dynamic allocation - int usertype_count; // !!! FIXME: dynamic allocation + StringBucket *string_hashtable[256]; + const char *usertypes[512]; // !!! FIXME: dynamic allocation + int usertype_count; } Context; -static void add_usertype(Context *ctx, const char *token, unsigned int len) +// Convenience functions for allocators... + +static inline void out_of_memory(Context *ctx) +{ + ctx->isfail = ctx->out_of_memory = 1; +} // out_of_memory + +static inline void *Malloc(Context *ctx, const size_t len) +{ + void *retval = ctx->malloc((int) len, ctx->malloc_data); + if (retval == NULL) + out_of_memory(ctx); + return retval; +} // Malloc + +static inline char *StrDup(Context *ctx, const char *str) +{ + char *retval = (char *) Malloc(ctx, strlen(str) + 1); + if (retval != NULL) + strcpy(retval, str); + return retval; +} // StrDup + +static inline void Free(Context *ctx, void *ptr) +{ + if (ptr != NULL) // check for NULL in case of dumb free() impl. + ctx->free(ptr, ctx->malloc_data); +} // Free + +typedef enum Operator +{ + OP_START_RANGE_UNARY, + OP_POSTINCREMENT, + OP_POSTDECREMENT, + OP_PREINCREMENT, + OP_PREDECREMENT, + OP_NEGATE, + OP_COMPLEMENT, + OP_NOT, + OP_END_RANGE_UNARY, + + OP_START_RANGE_BINARY, + OP_DEREF_ARRAY, + OP_CALLFUNC, + OP_DEREF_STRUCT, + OP_COMMA, + OP_MULTIPLY, + OP_DIVIDE, + OP_MODULO, + OP_ADD, + OP_SUBTRACT, + OP_LSHIFT, + OP_RSHIFT, + OP_LESSTHAN, + OP_GREATERTHAN, + OP_LESSTHANOREQUAL, + OP_GREATERTHANOREQUAL, + OP_EQUAL, + OP_NOTEQUAL, + OP_BINARYAND, + OP_BINARYXOR, + OP_BINARYOR, + OP_LOGICALAND, + OP_LOGICALOR, + OP_ASSIGN, + OP_MULASSIGN, + OP_DIVASSIGN, + OP_MODASSIGN, + OP_ADDASSIGN, + OP_SUBASSIGN, + OP_LSHIFTASSIGN, + OP_RSHIFTASSIGN, + OP_ANDASSIGN, + OP_XORASSIGN, + OP_ORASSIGN, + OP_END_RANGE_BINARY, + + OP_START_RANGE_TERNARY, + OP_CONDITIONAL, + OP_END_RANGE_TERNARY, + + OP_START_RANGE_DATA, + OP_IDENTIFIER, + OP_INT_LITERAL, + OP_FLOAT_LITERAL, + OP_STRING_LITERAL, + OP_END_RANGE_DATA, +} Operator; + +static inline int operator_is_unary(const Operator op) +{ + return ((op > OP_START_RANGE_UNARY) && (op < OP_END_RANGE_UNARY)); +} // operator_is_unary + +static inline int operator_is_binary(const Operator op) +{ + return ((op > OP_START_RANGE_BINARY) && (op < OP_END_RANGE_BINARY)); +} // operator_is_binary + +static inline int operator_is_ternary(const Operator op) +{ + return ((op > OP_START_RANGE_TERNARY) && (op < OP_END_RANGE_TERNARY)); +} // operator_is_ternary + + +typedef struct Expression +{ + Operator op; // operator +} Expression; + +#define NEW_EXPR(cls) \ + cls *retval = Malloc(ctx, sizeof (cls)); \ + if (retval == NULL) { return NULL; } + +typedef struct ExpressionUnary +{ + Operator op; // operator + Expression *operand; +} ExpressionUnary; + +typedef struct ExpressionBinary +{ + Operator op; // operator + Expression *left; + Expression *right; +} ExpressionBinary; + +typedef struct ExpressionTernary +{ + Operator op; // operator + Expression *left; + Expression *center; + Expression *right; +} ExpressionTernary; + +typedef struct ExpressionIdentifier +{ + Operator op; // Always OP_IDENTIFIER + const char *identifier; +} ExpressionIdentifier; + +typedef struct ExpressionIntLiteral +{ + Operator op; // Always OP_INT_LITERAL + int64 value; +} ExpressionIntLiteral; + +typedef struct ExpressionFloatLiteral +{ + Operator op; // Always OP_FLOAT_LITERAL + double value; +} ExpressionFloatLiteral; + +typedef struct ExpressionStringLiteral +{ + Operator op; // Always OP_STRING_LITERAL + const char *string; +} ExpressionStringLiteral; + +static Expression *new_unary_expr(Context *ctx, const Operator op, + Expression *operand) +{ + NEW_EXPR(ExpressionUnary); + assert(operator_is_unary(op)); + retval->op = op; + retval->operand = operand; + return (Expression *) retval; +} // new_unary_expr + +static Expression *new_binary_expr(Context *ctx, const Operator op, + Expression *left, Expression *right) +{ + NEW_EXPR(ExpressionBinary); + assert(operator_is_binary(op)); + retval->op = op; + retval->left = left; + retval->right = right; + return (Expression *) retval; +} // new_binary_expr + +static Expression *new_ternary_expr(Context *ctx, const Operator op, + Expression *left, Expression *center, + Expression *right) +{ + NEW_EXPR(ExpressionTernary); + assert(operator_is_ternary(op)); + retval->op = op; + retval->left = left; + retval->center = center; + retval->right = right; + return (Expression *) retval; +} // new_ternary_expr + +static Expression *new_identifier_expr(Context *ctx, const char *string) +{ + NEW_EXPR(ExpressionIdentifier); + retval->op = OP_IDENTIFIER; + retval->identifier = string; // cached; don't copy string. + return (Expression *) retval; +} // new_identifier_expr + +static inline int64 strtoi64(const char *str, unsigned int len) +{ + int64 retval = 0; + int64 mult = 1; + int i = 0; + + while ((len) && (*str == ' ')) + { + str++; + len--; + } // while + + if ((len) && (*str == '-')) + { + mult = -1; + str++; + len--; + } // if + + while (i < len) + { + const char ch = str[i]; + if ((ch < '0') || (ch > '9')) + break; + i++; + } // while + + while (--i >= 0) + { + const char ch = str[i]; + retval += ((int64) (ch - '0')) * mult; + mult *= 10; + } // while + + return retval; +} // strtoi64 + +static Expression *new_literal_int_expr(Context *ctx, const int64 value) +{ + NEW_EXPR(ExpressionIntLiteral); + retval->op = OP_INT_LITERAL; + retval->value = value; + return (Expression *) retval; +} // new_literal_int_expr + +static inline double strtodouble(const char *_str, unsigned int len) +{ + // !!! FIXME: laziness prevails. + char *str = (char *) alloca(len+1); + memcpy(str, _str, len); + str[len] = '\0'; + return strtod(str, NULL); +} // strtodouble + +static Expression *new_literal_float_expr(Context *ctx, const double dbl) +{ + NEW_EXPR(ExpressionFloatLiteral); + retval->op = OP_FLOAT_LITERAL; + retval->value = dbl; + return (Expression *) retval; +} // new_literal_float_expr + +static Expression *new_literal_string_expr(Context *ctx, const char *string) +{ + NEW_EXPR(ExpressionStringLiteral); + retval->op = OP_STRING_LITERAL; + retval->string = string; // cached; don't copy string. + return (Expression *) retval; +} // new_string_literal_expr + + +static void add_usertype(Context *ctx, const char *sym) { // !!! FIXME: error if this is a reserved keyword. // !!! FIXME: dynamic allocation assert(ctx->usertype_count < STATICARRAYLEN(ctx->usertypes)); - ctx->usertypes[ctx->usertype_count].token = token; - ctx->usertypes[ctx->usertype_count].tokenlen = len; + ctx->usertypes[ctx->usertype_count++] = sym; ctx->usertype_count++; } // add_usertype -static int is_usertype(const Context *ctx) +static int is_usertype(const Context *ctx, const char *token, + const unsigned int tokenlen) { // !!! FIXME: dynamic allocation // !!! FIXME: should probably redesign this anyhow. int i; for (i = 0; i < ctx->usertype_count; i++) { - if (ctx->usertypes[i].tokenlen == ctx->tokenlen) - { - if (memcmp(ctx->usertypes[i].token, ctx->token, ctx->tokenlen)==0) - return 1; - } // if + const char *type = ctx->usertypes[i]; + if (strncmp(type, token, tokenlen) == 0) + return type[tokenlen] == '\0'; } // for return 0; @@ -55,8 +336,112 @@ static int is_usertype(const Context *ctx) #define __MOJOSHADER_HLSL_COMPILER__ 1 #include "mojoshader_parser_hlsl.h" + +static void free_expr(Context *ctx, Expression *expr) +{ + if (operator_is_unary(expr->op)) + { + const ExpressionUnary *unary = (const ExpressionUnary *) expr; + free_expr(ctx, unary->operand); + } // if + else if (operator_is_binary(expr->op)) + { + const ExpressionBinary *binary = (const ExpressionBinary *) expr; + free_expr(ctx, binary->left); + free_expr(ctx, binary->right); + } // else if + else if (operator_is_ternary(expr->op)) + { + const ExpressionTernary *ternary = (const ExpressionTernary *) expr; + free_expr(ctx, ternary->left); + free_expr(ctx, ternary->center); + free_expr(ctx, ternary->right); + } // else if + + // don't need to free extra fields in other types at the moment. + + Free(ctx, expr); +} // free_expr + +// !!! FIXME: sort of cut-and-paste from the preprocessor... + +// this is djb's xor hashing function. +static inline uint32 hash_string_djbxor(const char *str, unsigned int len) +{ + register uint32 hash = 5381; + while (len--) + hash = ((hash << 5) + hash) ^ *(str++); + return hash; +} // hash_string_djbxor + +static inline uint8 hash_string(const char *str, const unsigned int len) +{ + return (uint8) hash_string_djbxor(str, len); +} // hash_string + +static const char *cache_string(Context *ctx, const char *str, + const unsigned int len) +{ + const uint8 hash = hash_string(str, len); + StringBucket *bucket = ctx->string_hashtable[hash]; + StringBucket *prev = NULL; + while (bucket) + { + const char *bstr = bucket->string; + if ((strncmp(bstr, str, len) == 0) && (bstr[len] == 0)) + { + // Matched! Move this to the front of the list. + if (prev != NULL) + { + assert(prev->next == bucket); + prev->next = bucket->next; + bucket->next = ctx->string_hashtable[hash]; + ctx->string_hashtable[hash] = bucket; + } // if + return bstr; // already cached + } // if + prev = bucket; + bucket = bucket->next; + } // while + + // no match, add to the table. + bucket = (StringBucket *) Malloc(ctx, sizeof (StringBucket)); + if (bucket == NULL) + return NULL; + bucket->string = (char *) Malloc(ctx, len + 1); + if (bucket->string == NULL) + { + Free(ctx, bucket); + return NULL; + } // if + memcpy(bucket->string, str, len); + bucket->string[len] = '\0'; + bucket->next = ctx->string_hashtable[hash]; + ctx->string_hashtable[hash] = bucket; + return bucket->string; +} // cache_string + +static void free_string_cache(Context *ctx) +{ + size_t i; + for (i = 0; i < STATICARRAYLEN(ctx->string_hashtable); i++) + { + StringBucket *bucket = ctx->string_hashtable[i]; + ctx->string_hashtable[i] = NULL; + while (bucket) + { + StringBucket *next = bucket->next; + Free(ctx, bucket->string); + Free(ctx, bucket); + bucket = next; + } // while + } // for +} // free_string_cache + + // This does not check correctness (POSITIONT993842 passes, etc). -static int is_semantic(const Context *ctx) +static int is_semantic(const Context *ctx, const char *token, + const unsigned int tokenlen) { static const char *names[] = { "BINORMAL", "BLENDINDICES", "BLENDWEIGHT", @@ -71,9 +456,9 @@ static int is_semantic(const Context *ctx) { const char *name = *i; const size_t namelen = strlen(name); - if (ctx->tokenlen < namelen) + if (tokenlen < namelen) continue; - else if (memcmp(ctx->token, name, namelen) != 0) + else if (memcmp(token, name, namelen) != 0) continue; for (name += namelen; *name; name++) @@ -90,9 +475,10 @@ static int is_semantic(const Context *ctx) } // is_semantic -static int convert_to_lemon_token(const Context *ctx) +static int convert_to_lemon_token(const Context *ctx, const char *token, + unsigned int tokenlen, const Token tokenval) { - switch (ctx->tokenval) + switch (tokenval) { case ((Token) ','): return TOKEN_HLSL_COMMA; case ((Token) '='): return TOKEN_HLSL_ASSIGN; @@ -143,7 +529,7 @@ static int convert_to_lemon_token(const Context *ctx) case ((Token) '}'): return TOKEN_HLSL_RBRACE; case ((Token) TOKEN_IDENTIFIER): - #define tokencmp(t) ((ctx->tokenlen == strlen(t)) && (memcmp(ctx->token, t, ctx->tokenlen) == 0)) + #define tokencmp(t) ((tokenlen == strlen(t)) && (memcmp(token, t, tokenlen) == 0)) //case ((Token) ''): return TOKEN_HLSL_TYPECAST //if (tokencmp("")) return TOKEN_HLSL_TYPE_NAME //if (tokencmp("...")) return TOKEN_HLSL_ELIPSIS @@ -335,9 +721,9 @@ static int convert_to_lemon_token(const Context *ctx) #undef tokencmp - if (is_semantic(ctx)) + if (is_semantic(ctx, token, tokenlen)) return TOKEN_HLSL_SEMANTIC; - else if (is_usertype(ctx)) + else if (is_usertype(ctx, token, tokenlen)) return TOKEN_HLSL_USERTYPE; return TOKEN_HLSL_IDENTIFIER; @@ -352,18 +738,27 @@ static int convert_to_lemon_token(const Context *ctx) void MOJOSHADER_compile(const char *filename, - const char *source, unsigned int sourcelen, - const MOJOSHADER_preprocessorDefine *defines, - unsigned int define_count, - MOJOSHADER_includeOpen include_open, - MOJOSHADER_includeClose include_close, - MOJOSHADER_malloc m, MOJOSHADER_free f, void *d) + const char *source, unsigned int sourcelen, + const MOJOSHADER_preprocessorDefine *defines, + unsigned int define_count, + MOJOSHADER_includeOpen include_open, + MOJOSHADER_includeClose include_close, + MOJOSHADER_malloc m, MOJOSHADER_free f, void *d) { Context ctx; + TokenData data; + unsigned int tokenlen; + Token tokenval; + const char *token; + int lemon_token; + if (m == NULL) m = MOJOSHADER_internal_malloc; if (f == NULL) f = MOJOSHADER_internal_free; memset(&ctx, '\0', sizeof (Context)); + ctx.malloc = m; + ctx.free = f; + ctx.malloc_data = d; ctx.preprocessor = preprocessor_start(filename, source, sourcelen, include_open, include_close, defines, define_count, 0, m, f, d); @@ -375,15 +770,37 @@ void MOJOSHADER_compile(const char *filename, #endif do { - ctx.token = preprocessor_nexttoken(ctx.preprocessor, - &ctx.tokenlen, - &ctx.tokenval); + token = preprocessor_nexttoken(ctx.preprocessor, &tokenlen, &tokenval); + lemon_token = convert_to_lemon_token(&ctx, token, tokenlen, tokenval); + switch (lemon_token) + { + case TOKEN_HLSL_INT_CONSTANT: + data.i64 = strtoi64(token, tokenlen); + break; + + case TOKEN_HLSL_FLOAT_CONSTANT: + data.dbl = strtodouble(token, tokenlen); + break; + + case TOKEN_HLSL_SEMANTIC: + case TOKEN_HLSL_USERTYPE: + case TOKEN_HLSL_STRING_LITERAL: + case TOKEN_HLSL_IDENTIFIER: + data.string = cache_string(&ctx, token, tokenlen); + break; + + default: + data.i64 = 0; + break; + } // switch + + ParseHLSL(pParser, lemon_token, data, &ctx); + } while ((!ctx.isfail) && (tokenval != TOKEN_EOI)); - TokenData token = { ctx.token, ctx.tokenlen }; - ParseHLSL(pParser, convert_to_lemon_token(&ctx), token, &ctx); - } while (ctx.tokenval != TOKEN_EOI); ParseHLSLFree(pParser, f, d); -} + // !!! FIXME: destruct (ctx) here. + free_string_cache(&ctx); +} // MOJOSHADER_compile // end of mojoshader_compiler.c ... diff --git a/mojoshader_parser_hlsl.lemon b/mojoshader_parser_hlsl.lemon index 451dc21b..d01d0c7d 100644 --- a/mojoshader_parser_hlsl.lemon +++ b/mojoshader_parser_hlsl.lemon @@ -39,10 +39,14 @@ } %parse_failure { + // !!! FIXME: make this a proper fail() function. + ctx->isfail = 1; fprintf(stderr,"Giving up. Parser is hopelessly lost...\n"); } %stack_overflow { + // !!! FIXME: make this a proper fail() function. + ctx->isfail = 1; fprintf(stderr,"Giving up. Parser stack overflow\n"); } @@ -72,6 +76,8 @@ // The rules... +%type shader { int } // !!! FIXME: remove this later. +%destructor shader { (void) ctx; } // !!! FIXME: remove this later. shader ::= compilation_units. compilation_units ::= compilation_unit. @@ -92,8 +98,8 @@ function_signature ::= function_storageclass function_details. function_signature ::= function_details semantic. function_signature ::= function_details. -function_details ::= datatype identifier LPAREN function_arguments RPAREN. -function_details ::= VOID identifier LPAREN function_arguments RPAREN. +function_details ::= datatype IDENTIFIER LPAREN function_arguments RPAREN. +function_details ::= VOID IDENTIFIER LPAREN function_arguments RPAREN. // !!! FIXME: there is a "target" storage class that is the name of the // !!! FIXME: platform that this function is meant for...but I don't know @@ -111,22 +117,22 @@ function_arguments ::= . function_argument_list ::= function_argument. function_argument_list ::= function_argument_list COMMA function_argument. -function_argument ::= input_modifier datatype identifier semantic interpolation_mod initializer. -function_argument ::= input_modifier datatype identifier semantic interpolation_mod. -function_argument ::= input_modifier datatype identifier semantic initializer. -function_argument ::= input_modifier datatype identifier semantic. -function_argument ::= input_modifier datatype identifier interpolation_mod initializer. -function_argument ::= input_modifier datatype identifier interpolation_mod. -function_argument ::= input_modifier datatype identifier initializer. -function_argument ::= input_modifier datatype identifier. -function_argument ::= datatype identifier semantic interpolation_mod initializer. -function_argument ::= datatype identifier semantic interpolation_mod. -function_argument ::= datatype identifier semantic initializer. -function_argument ::= datatype identifier semantic. -function_argument ::= datatype identifier interpolation_mod initializer. -function_argument ::= datatype identifier interpolation_mod. -function_argument ::= datatype identifier initializer. -function_argument ::= datatype identifier. +function_argument ::= input_modifier datatype IDENTIFIER semantic interpolation_mod initializer. +function_argument ::= input_modifier datatype IDENTIFIER semantic interpolation_mod. +function_argument ::= input_modifier datatype IDENTIFIER semantic initializer. +function_argument ::= input_modifier datatype IDENTIFIER semantic. +function_argument ::= input_modifier datatype IDENTIFIER interpolation_mod initializer. +function_argument ::= input_modifier datatype IDENTIFIER interpolation_mod. +function_argument ::= input_modifier datatype IDENTIFIER initializer. +function_argument ::= input_modifier datatype IDENTIFIER. +function_argument ::= datatype IDENTIFIER semantic interpolation_mod initializer. +function_argument ::= datatype IDENTIFIER semantic interpolation_mod. +function_argument ::= datatype IDENTIFIER semantic initializer. +function_argument ::= datatype IDENTIFIER semantic. +function_argument ::= datatype IDENTIFIER interpolation_mod initializer. +function_argument ::= datatype IDENTIFIER interpolation_mod. +function_argument ::= datatype IDENTIFIER initializer. +function_argument ::= datatype IDENTIFIER. input_modifier ::= IN. input_modifier ::= INOUT. @@ -172,9 +178,9 @@ variable_declaration_details ::= scalar_or_array. // !!! FIXME: we don't handle full sampler declarations at the moment. -struct_declaration ::= STRUCT identifier(A) LBRACE struct_member_list RBRACE. +struct_declaration ::= STRUCT IDENTIFIER(A) LBRACE struct_member_list RBRACE. { - add_usertype(ctx, A.token, A.tokenlen); + add_usertype(ctx, A.string); } struct_member_list ::= struct_member. @@ -187,7 +193,7 @@ struct_member_details ::= datatype struct_member_item_list SEMICOLON. struct_member_item_list ::= scalar_or_array. struct_member_item_list ::= scalar_or_array semantic. -struct_member_item_list ::= struct_member_item_list COMMA identifier. +struct_member_item_list ::= struct_member_item_list COMMA IDENTIFIER. typedef_statement ::= TYPEDEF CONST datatype scalar_or_array. typedef_statement ::= TYPEDEF datatype scalar_or_array. @@ -196,14 +202,14 @@ variable_lowlevel ::= packoffset register. variable_lowlevel ::= packoffset. variable_lowlevel ::= register. -scalar_or_array ::= identifier LBRACKET RBRACKET. -scalar_or_array ::= identifier LBRACKET expression RBRACKET. -scalar_or_array ::= identifier. +scalar_or_array ::= IDENTIFIER LBRACKET RBRACKET. +scalar_or_array ::= IDENTIFIER LBRACKET expression RBRACKET. +scalar_or_array ::= IDENTIFIER. -packoffset ::= PACKOFFSET LPAREN identifier identifier RPAREN. -packoffset ::= PACKOFFSET LPAREN identifier RPAREN. +packoffset ::= PACKOFFSET LPAREN IDENTIFIER IDENTIFIER RPAREN. +packoffset ::= PACKOFFSET LPAREN IDENTIFIER RPAREN. -register ::= COLON REGISTER LPAREN identifier RPAREN. +register ::= COLON REGISTER LPAREN IDENTIFIER RPAREN. annotations ::= LT annotation_list GT. @@ -485,100 +491,110 @@ switch_case ::= CASE expression COLON. switch_case ::= DEFAULT COLON statement_list. switch_case ::= DEFAULT COLON. -%type identifier { TokenData } -%destructor identifier { (void) ctx; } // !!! FIXME: remove this later, it's just to shut up the compiler for now. -identifier(A) ::= IDENTIFIER(B). { A = B; } - // the expression stuff is based on Jeff Lee's ANSI C grammar. -primary_expr ::= identifier. -primary_expr ::= INT_CONSTANT. -primary_expr ::= FLOAT_CONSTANT. -primary_expr ::= STRING_LITERAL. -primary_expr ::= LPAREN expression RPAREN. - -postfix_expr ::= primary_expr. -postfix_expr ::= postfix_expr LBRACKET expression RBRACKET. -postfix_expr ::= postfix_expr LPAREN RPAREN. -postfix_expr ::= postfix_expr LPAREN argument_expr_list RPAREN. -postfix_expr ::= datatype LPAREN argument_expr_list RPAREN. // HLSL constructor -postfix_expr ::= postfix_expr DOT identifier. -postfix_expr ::= postfix_expr PLUSPLUS. -postfix_expr ::= postfix_expr MINUSMINUS. - -argument_expr_list ::= assignment_expr. -argument_expr_list ::= argument_expr_list COMMA assignment_expr. - -unary_expr ::= postfix_expr. -unary_expr ::= PLUSPLUS unary_expr. -unary_expr ::= MINUSMINUS unary_expr. -unary_expr ::= unary_operator cast_expr. - -unary_operator ::= PLUS. -unary_operator ::= MINUS. -unary_operator ::= COMPLEMENT. -unary_operator ::= EXCLAMATION. - -cast_expr ::= unary_expr. -cast_expr ::= LPAREN datatype RPAREN cast_expr. - -multiplicative_expr ::= cast_expr. -multiplicative_expr ::= multiplicative_expr STAR cast_expr. -multiplicative_expr ::= multiplicative_expr SLASH cast_expr. -multiplicative_expr ::= multiplicative_expr PERCENT cast_expr. - -additive_expr ::= multiplicative_expr. -additive_expr ::= additive_expr PLUS multiplicative_expr. -additive_expr ::= additive_expr MINUS multiplicative_expr. - -shift_expr ::= additive_expr. -shift_expr ::= shift_expr LSHIFT additive_expr. -shift_expr ::= shift_expr RSHIFT additive_expr. - -relational_expr ::= shift_expr. -relational_expr ::= relational_expr LT shift_expr. -relational_expr ::= relational_expr GT shift_expr. -relational_expr ::= relational_expr LEQ shift_expr. -relational_expr ::= relational_expr GEQ shift_expr. - -equality_expr ::= relational_expr. -equality_expr ::= equality_expr EQL relational_expr. -equality_expr ::= equality_expr NEQ relational_expr. - -and_expr ::= equality_expr. -and_expr ::= and_expr AND equality_expr. - -exclusive_or_expr ::= and_expr. -exclusive_or_expr ::= exclusive_or_expr XOR and_expr. - -inclusive_or_expr ::= exclusive_or_expr. -inclusive_or_expr ::= inclusive_or_expr OR exclusive_or_expr. - -logical_and_expr ::= inclusive_or_expr. -logical_and_expr ::= logical_and_expr ANDAND inclusive_or_expr. - -logical_or_expr ::= logical_and_expr. -logical_or_expr ::= logical_or_expr OROR logical_and_expr. - -conditional_expr ::= logical_or_expr. -conditional_expr ::= logical_or_expr QUESTION logical_or_expr COLON conditional_expr. - -assignment_expr ::= conditional_expr. -assignment_expr ::= unary_expr assignment_operator assignment_expr. - -assignment_operator ::= ASSIGN. -assignment_operator ::= MULASSIGN. -assignment_operator ::= DIVASSIGN. -assignment_operator ::= MODASSIGN. -assignment_operator ::= ADDASSIGN. -assignment_operator ::= SUBASSIGN. -assignment_operator ::= LSHIFTASSIGN. -assignment_operator ::= RSHIFTASSIGN. -assignment_operator ::= ANDASSIGN. -assignment_operator ::= XORASSIGN. -assignment_operator ::= ORASSIGN. - -expression ::= assignment_expr. -expression ::= expression COMMA assignment_expr. +%type primary_expr { Expression * } +primary_expr(A) ::= IDENTIFIER(B). { A = new_identifier_expr(ctx, B.string); } +primary_expr(A) ::= INT_CONSTANT(B). { A = new_literal_int_expr(ctx, B.i64); } +primary_expr(A) ::= FLOAT_CONSTANT(B). { A = new_literal_float_expr(ctx, B.dbl); } +primary_expr(A) ::= STRING_LITERAL(B). { A = new_literal_string_expr(ctx, B.string); } +primary_expr(A) ::= LPAREN expression(B) RPAREN. { A = B; } + +%type postfix_expr { Expression * } +postfix_expr(A) ::= primary_expr(B). { A = B; } +postfix_expr(A) ::= postfix_expr(B) LBRACKET expression(C) RBRACKET. { A = new_binary_expr(ctx, OP_DEREF_ARRAY, B, C); } +postfix_expr(A) ::= postfix_expr(B) LPAREN RPAREN. { A = new_binary_expr(ctx, OP_CALLFUNC, B, NULL); } +postfix_expr(A) ::= postfix_expr(B) LPAREN argument_expr_list(C) RPAREN. { A = new_binary_expr(ctx, OP_CALLFUNC, B, C); } +//postfix_expr(A) ::= datatype(B) LPAREN argument_expr_list(C) RPAREN. { A = new_constructor_expr(ctx, B, C); } // HLSL constructor +postfix_expr(A) ::= postfix_expr(B) DOT IDENTIFIER(C). { A = new_binary_expr(ctx, OP_DEREF_STRUCT, B, new_identifier_expr(ctx, C.string)); } +postfix_expr(A) ::= postfix_expr(B) PLUSPLUS. { A = new_unary_expr(ctx, OP_POSTINCREMENT, B); } +postfix_expr(A) ::= postfix_expr(B) MINUSMINUS. { A = new_unary_expr(ctx, OP_POSTDECREMENT, B); } + +%type argument_expr_list { Expression * } +argument_expr_list(A) ::= assignment_expr(B). { A = B; } +argument_expr_list(A) ::= argument_expr_list(B) COMMA assignment_expr(C). { A = new_binary_expr(ctx, OP_COMMA, B, C); } + +%type unary_expr { Expression * } +unary_expr(A) ::= postfix_expr(B). { A = B; } +unary_expr(A) ::= PLUSPLUS unary_expr(B). { A = new_unary_expr(ctx, OP_PREINCREMENT, B); } +unary_expr(A) ::= MINUSMINUS unary_expr(B). { A = new_unary_expr(ctx, OP_PREDECREMENT, B); } +unary_expr(A) ::= PLUS cast_expr(B). { A = B; } // unary "+x" is always a no-op, so throw it away here. +unary_expr(A) ::= MINUS cast_expr(B). { A = new_unary_expr(ctx, OP_NEGATE, B); } +unary_expr(A) ::= COMPLEMENT cast_expr(B). { A = new_unary_expr(ctx, OP_COMPLEMENT, B); } +unary_expr(A) ::= EXCLAMATION cast_expr(B). { A = new_unary_expr(ctx, OP_NOT, B); } + +%type cast_expr { Expression * } +cast_expr(A) ::= unary_expr(B). { A = B; } +//cast_expr(A) ::= LPAREN datatype(B) RPAREN cast_expr(C). { A = new_cast_expr(ctx, B, C); } + +%type multiplicative_expr { Expression * } +multiplicative_expr(A) ::= cast_expr(B). { A = B; } +multiplicative_expr(A) ::= multiplicative_expr(B) STAR cast_expr(C). { A = new_binary_expr(ctx, OP_MULTIPLY, B, C); } +multiplicative_expr(A) ::= multiplicative_expr(B) SLASH cast_expr(C). { A = new_binary_expr(ctx, OP_DIVIDE, B, C); } +multiplicative_expr(A) ::= multiplicative_expr(B) PERCENT cast_expr(C). { A = new_binary_expr(ctx, OP_MODULO, B, C); } + +%type additive_expr { Expression * } +additive_expr(A) ::= multiplicative_expr(B). { A = B; } +additive_expr(A) ::= additive_expr(B) PLUS multiplicative_expr(C). { A = new_binary_expr(ctx, OP_ADD, B, C); } +additive_expr(A) ::= additive_expr(B) MINUS multiplicative_expr(C). { A = new_binary_expr(ctx, OP_SUBTRACT, B, C); } + +%type shift_expr { Expression * } +shift_expr(A) ::= additive_expr(B). { A = B; } +shift_expr(A) ::= shift_expr(B) LSHIFT additive_expr(C). { A = new_binary_expr(ctx, OP_LSHIFT, B, C); } +shift_expr(A) ::= shift_expr(B) RSHIFT additive_expr(C). { A = new_binary_expr(ctx, OP_RSHIFT, B, C); } + +%type relational_expr { Expression * } +relational_expr(A) ::= shift_expr(B). { A = B; } +relational_expr(A) ::= relational_expr(B) LT shift_expr(C). { A = new_binary_expr(ctx, OP_LESSTHAN, B, C); } +relational_expr(A) ::= relational_expr(B) GT shift_expr(C). { A = new_binary_expr(ctx, OP_GREATERTHAN, B, C); } +relational_expr(A) ::= relational_expr(B) LEQ shift_expr(C). { A = new_binary_expr(ctx, OP_LESSTHANOREQUAL, B, C); } +relational_expr(A) ::= relational_expr(B) GEQ shift_expr(C). { A = new_binary_expr(ctx, OP_GREATERTHANOREQUAL, B, C); } + +%type equality_expr { Expression * } +equality_expr(A) ::= relational_expr(B). { A = B; } +equality_expr(A) ::= equality_expr(B) EQL relational_expr(C). { A = new_binary_expr(ctx, OP_EQUAL, B, C); } +equality_expr(A) ::= equality_expr(B) NEQ relational_expr(C). { A = new_binary_expr(ctx, OP_NOTEQUAL, B, C); } + +%type and_expr { Expression * } +and_expr(A) ::= equality_expr(B). { A = B; } +and_expr(A) ::= and_expr(B) AND equality_expr(C). { A = new_binary_expr(ctx, OP_BINARYAND, B, C); } + +%type exclusive_or_expr { Expression * } +exclusive_or_expr(A) ::= and_expr(B). { A = B; } +exclusive_or_expr(A) ::= exclusive_or_expr(B) XOR and_expr(C). { A = new_binary_expr(ctx, OP_BINARYXOR, B, C); } + +%type inclusive_or_expr { Expression * } +inclusive_or_expr(A) ::= exclusive_or_expr(B). { A = B; } +inclusive_or_expr(A) ::= inclusive_or_expr(B) OR exclusive_or_expr(C). { A = new_binary_expr(ctx, OP_BINARYOR, B, C); } + +%type logical_and_expr { Expression * } +logical_and_expr(A) ::= inclusive_or_expr(B). { A = B; } +logical_and_expr(A) ::= logical_and_expr(B) ANDAND inclusive_or_expr(C). { A = new_binary_expr(ctx, OP_LOGICALAND, B, C); } + +%type logical_or_expr { Expression * } +logical_or_expr(A) ::= logical_and_expr(B). { A = B; } +logical_or_expr(A) ::= logical_or_expr(B) OROR logical_and_expr(C). { A = new_binary_expr(ctx, OP_LOGICALOR, B, C); } + +%type conditional_expr { Expression * } +conditional_expr(A) ::= logical_or_expr(B). { A = B; } +conditional_expr(A) ::= logical_or_expr(B) QUESTION logical_or_expr(C) COLON conditional_expr(D). { A = new_ternary_expr(ctx, OP_CONDITIONAL, B, C, D); } + +%type assignment_expr { Expression * } +assignment_expr(A) ::= conditional_expr(B). { A = B; } +assignment_expr(A) ::= unary_expr(B) ASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_ASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) MULASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_MULASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) DIVASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_DIVASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) MODASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_MODASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) ADDASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_ADDASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) SUBASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_SUBASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) LSHIFTASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_LSHIFTASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) RSHIFTASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_RSHIFTASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) ANDASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_ANDASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) XORASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_XORASSIGN, B, C); } +assignment_expr(A) ::= unary_expr(B) ORASSIGN assignment_expr(C). { A = new_binary_expr(ctx, OP_ORASSIGN, B, C); } + +%type expression { Expression * } +expression(A) ::= assignment_expr(B). { A = B; } +expression(A) ::= expression(B) COMMA assignment_expr(C). { A = new_binary_expr(ctx, OP_COMMA, B, C); } // end of mojoshader_parser_hlsl.lemon ...