|
|
| version 1.19, 2001/03/08 10:07:10 | version 1.41, 2002/01/24 17:18:48 |
|---|---|
| Line 1 | Line 1 |
| /* | /** @file |
| $Id$ | Parser: compiler support helper functions. |
| Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) | |
| Author: Alexander Petrosyan <paf@design.ru> (http://paf.design.ru) | |
| $Id$ | |
| */ | */ |
| #include "compile_tools.h" | #include "compile_tools.h" |
| Line 9 | Line 14 |
| #include "pa_vstring.h" | #include "pa_vstring.h" |
| #include "pa_vdouble.h" | #include "pa_vdouble.h" |
| void PV(Array/*<op>*/ *result, Value *value) { | void PV(Array/*<Operation>*/ *result, Value *value) { |
| // append OP_VALUE | // append OP_VALUE |
| Operation op; op.code=OP_VALUE; | Operation op; op.code=OP_VALUE; |
| *result+=op.cast; | *result+=op.cast; |
| Line 18 void PV(Array/*<op>*/ *result, Value *va | Line 23 void PV(Array/*<op>*/ *result, Value *va |
| *result+=value; | *result+=value; |
| } | } |
| void PCA(Array/*<op>*/ *result, Array/*<op>*/ *code_array) { | void PCA(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array) { |
| // append OP_CODE | // append OP_CODE |
| Operation op; op.code=OP_CODE__STORE_PARAM; | Operation op; op.code=OP_CURLY_CODE__STORE_PARAM; |
| *result+=op.cast; | |
| // append 'vstring' | |
| *result+=code_array; | |
| } | |
| void PEA(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array) { | |
| // append OP_CODE | |
| Operation op; op.code=OP_EXPR_CODE__STORE_PARAM; | |
| *result+=op.cast; | |
| // append 'vstring' | |
| *result+=code_array; | |
| } | |
| void CCA(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array) { | |
| // append OP_CODE | |
| Operation op; op.code=OP_CURLY_CODE__CONSTRUCT; | |
| *result+=op.cast; | |
| // append 'vstring' | |
| *result+=code_array; | |
| } | |
| void PNC(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array) { | |
| // append OP_CODE | |
| Operation op; op.code=OP_NESTED_CODE; | |
| *result+=op.cast; | *result+=op.cast; |
| // append 'vstring' | // append 'vstring' |
| Line 38 Array *VL(Value *value) { | Line 70 Array *VL(Value *value) { |
| return result; | return result; |
| } | } |
| String *SLA2S(Array *literal_string_array, int offset) { | Value *LA2V(Array *literal_string_array, int offset) { |
| Operation op; | Operation op; |
| op.cast=literal_string_array->get(offset+0); | op.cast=literal_string_array->get(offset+0); |
| if(op.code!=OP_VALUE) | if(op.code!=OP_VALUE) |
| return 0; | return 0; |
| return static_cast<VString *>(literal_string_array->get(offset+1))->get_string(); | return static_cast<Value *>(literal_string_array->get(offset+1)); |
| } | } |
| void change_string_literal_to_double_literal(Array *literal_string_array) { | void change_string_literal_to_double_literal(Array *literal_string_array) { |
| VString *vstring=static_cast<VString *>(literal_string_array->get(1)); | VString *vstring=static_cast<VString *>(literal_string_array->get(1)); |
| Pool& pool=vstring->pool(); | Value *value=vstring->as_expr_result(); |
| VDouble *vdouble=new(pool) VDouble(pool, vstring->get_double()); | literal_string_array->put(1, value); |
| literal_string_array->put(1, vdouble); | } |
| void change_string_literal_to_write_string_literal(Array *literal_string_array) { | |
| Operation op; op.code=OP_STRING__WRITE; | |
| literal_string_array->put(0, op.cast); | |
| } | } |
| void push_LS(parse_control& pc, lexical_state new_state) { | |
| void push_LS(struct parse_control *pc, lexical_state new_state) { | if(pc.sp<MAX_LEXICAL_STATES) { |
| if(pc->sp<MAX_LEXICAL_STATES) { | pc.stack[pc.sp++]=pc.ls; pc.ls=new_state; |
| pc->stack[pc->sp++]=pc->ls; pc->ls=new_state; | |
| } else | } else |
| pc->pool->THROW(0, 0, 0, "push_LS: stack overflow"); | throw Exception(0, 0, 0, "push_LS: stack overflow"); |
| } | } |
| void pop_LS(struct parse_control *pc) { | void pop_LS(parse_control& pc) { |
| if(--pc->sp>=0) | if(--pc.sp>=0) |
| pc->ls=pc->stack[pc->sp]; | pc.ls=pc.stack[pc.sp]; |
| else | else |
| pc->pool->THROW(0, 0, 0, "push_LS: stack underflow"); | throw Exception(0, 0, 0, "pop_LS: stack underflow"); |
| } | } |