Annotation of parser3/src/main/compile_tools.C, revision 1.26
1.1 paf 1: /*
1.25 paf 2: Parser
3: Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
1.26 ! paf 4: Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
1.25 paf 5:
1.26 ! paf 6: $Id: compile_tools.C,v 1.25 2001/03/10 16:34:38 paf Exp $
1.1 paf 7: */
8:
9: #include "compile_tools.h"
10: #include "pa_string.h"
11: #include "pa_array.h"
12: #include "pa_exception.h"
1.9 paf 13: #include "pa_vstring.h"
1.15 paf 14: #include "pa_vdouble.h"
1.1 paf 15:
1.17 paf 16: void PV(Array/*<op>*/ *result, Value *value) {
1.16 paf 17: // append OP_VALUE
18: Operation op; op.code=OP_VALUE;
1.6 paf 19: *result+=op.cast;
1.1 paf 20:
1.17 paf 21: // append 'value'
22: *result+=value;
1.12 paf 23: }
1.13 paf 24:
25: void PCA(Array/*<op>*/ *result, Array/*<op>*/ *code_array) {
26: // append OP_CODE
1.18 paf 27: Operation op; op.code=OP_CODE__STORE_PARAM;
1.13 paf 28: *result+=op.cast;
29:
30: // append 'vstring'
31: *result+=code_array;
32: }
33:
1.12 paf 34:
1.17 paf 35: Array *VL(Value *value) {
1.12 paf 36: // empty ops array
1.17 paf 37: Array *result=N(value->pool());
1.12 paf 38:
1.17 paf 39: // append 'value' to 'result'
40: PV(result, value);
1.14 paf 41:
42: return result;
43: }
1.1 paf 44:
1.23 paf 45: const String *SLA2S(Array *literal_string_array, int offset) {
1.11 paf 46: Operation op;
47: op.cast=literal_string_array->get(offset+0);
1.16 paf 48: if(op.code!=OP_VALUE)
1.11 paf 49: return 0;
50:
1.10 paf 51: return static_cast<VString *>(literal_string_array->get(offset+1))->get_string();
1.15 paf 52: }
53:
54: void change_string_literal_to_double_literal(Array *literal_string_array) {
55: VString *vstring=static_cast<VString *>(literal_string_array->get(1));
1.22 paf 56: Value *value=vstring->get_expr_result();
57: literal_string_array->put(1, value);
1.1 paf 58: }
1.24 paf 59: void change_string_literal_to_write_string_literal(Array *literal_string_array) {
60: Operation op; op.code=OP_STRING__WRITE;
61: literal_string_array->put(0, op.cast);
62: }
1.1 paf 63:
1.5 paf 64: void push_LS(struct parse_control *pc, lexical_state new_state) {
1.1 paf 65: if(pc->sp<MAX_LEXICAL_STATES) {
1.5 paf 66: pc->stack[pc->sp++]=pc->ls; pc->ls=new_state;
1.1 paf 67: } else
1.7 paf 68: pc->pool->THROW(0, 0, 0, "push_LS: stack overflow");
1.1 paf 69: }
70: void pop_LS(struct parse_control *pc) {
71: if(--pc->sp>=0)
72: pc->ls=pc->stack[pc->sp];
73: else
1.7 paf 74: pc->pool->THROW(0, 0, 0, "push_LS: stack underflow");
1.1 paf 75: }
E-mail: