|
|
| version 1.3, 2001/02/21 06:21:19 | version 1.54.2.5.2.6, 2003/04/02 08:35:43 |
|---|---|
| Line 1 | Line 1 |
| /* | /** @file |
| $Id$ | Parser: compiler support helper functions. |
| Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com) | |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | |
| */ | */ |
| static const char* IDENT_COMPILE_TOOLS_C="$Date$"; | |
| #include "compile_tools.h" | #include "compile_tools.h" |
| #include "pa_string.h" | #include "pa_string.h" |
| #include "pa_array.h" | #include "pa_array.h" |
| #include "pa_exception.h" | #include "pa_exception.h" |
| #include "pa_vstring.h" | |
| #include "pa_vdouble.h" | |
| Array *L(String *string) { | Value* LA2V(ArrayOperation& literal_string_array, int offset) { |
| // empty ops array | return literal_string_array[offset+0].code==OP_VALUE?literal_string_array[offset+1].value |
| Array *result=N(&string->pool()); | :0; |
| } | |
| // append OP_STRING | |
| Operation op; op.code=OP_STRING; | |
| *result+=reinterpret_cast<Array::Item *>(op.cast); | |
| // append 'string' | void change_string_literal_to_double_literal(ArrayOperation& literal_string_array) { |
| *result+=string; | if(literal_string_array[0].code==OP_VALUE) { |
| Value* value=literal_string_array[1].value->as_expr_result(); | |
| literal_string_array.put(1, value); | |
| } | |
| } | |
| return result; | void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value) { |
| if(literal_string_array[0].code==OP_VALUE) { // extra safety | |
| static_cast<VString*>(literal_string_array[1].value)->set_string(new_value); | |
| } | |
| } | } |
| const String *LA2S(Array *literal_string_array) { | void changetail_or_append(ArrayOperation& opcodes, |
| return static_cast<const String *>(literal_string_array->get(1)); | OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound) { |
| int tail=opcodes.count()-(with_argument?2:1); | |
| if(tail>=0) { | |
| Operation& op=opcodes.get_ref(tail); | |
| if(op.code==find) { | |
| op.code=replace; | |
| return; | |
| } | |
| } | |
| opcodes+=Operation(notfound); | |
| } | } |
| void push_LS(struct parse_control *pc) { | void push_LS(parse_control& pc, lexical_state new_state) { |
| if(pc->sp<MAX_LEXICAL_STATES) { | if(pc.ls_sp<MAX_LEXICAL_STATES) { |
| pc->stack[pc->sp++]=pc->ls; pc->ls=LS_VAR_NAME_SIMPLE; | pc.ls_stack[pc.ls_sp++]=pc.ls; |
| pc.ls=new_state; | |
| } else | } else |
| (static_cast<Pool *>(pc->pool))->exception().raise(0, 0, 0, | throw Exception(0, 0, |
| "push_LS: stack overflow"); | "push_LS: ls_stack overflow"); |
| } | } |
| void pop_LS(struct parse_control *pc) { | void pop_LS(parse_control& pc) { |
| if(--pc->sp>=0) | if(--pc.ls_sp>=0) |
| pc->ls=pc->stack[pc->sp]; | pc.ls=pc.ls_stack[pc.ls_sp]; |
| else | else |
| (static_cast<Pool *>(pc->pool))->exception().raise(0, 0, 0, | throw Exception(0, 0, |
| "push_LS: stack underflow"); | "pop_LS: ls_stack underflow"); |
| } | } |