Annotation of parser3/src/main/compile_tools.h, revision 1.67.2.8.2.3
1.32 paf 1: /** @file
1.33 paf 2: Parser: compiler support helper functions decls.
3:
1.67.2.6 paf 4: Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)
1.58 paf 5: Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
1.1 paf 6: */
7:
8: #ifndef COMPILE_TOOLS
9: #define COMPILE_TOOLS
1.62 paf 10:
1.67.2.8.2.3! paf 11: static const char* IDENT_COMPILE_TOOLS_H="$Date: 2003/03/21 13:42:30 $";
1.1 paf 12:
1.39 paf 13: #include "pa_opcode.h"
1.1 paf 14: #include "pa_types.h"
1.10 paf 15: #include "pa_vstring.h"
1.14 paf 16: #include "pa_request.h"
1.67.2.8.2.2 paf 17:
1.1 paf 18: enum lexical_state {
1.48 parser 19: LS_USER, LS_NAME_SQUARE_PART,
1.65 paf 20: LS_USER_COMMENT,
1.7 paf 21: LS_DEF_NAME,
22: LS_DEF_PARAMS,
23: LS_DEF_LOCALS,
24: LS_DEF_COMMENT,
1.18 paf 25: LS_DEF_SPECIAL_BODY,
1.42 parser 26: LS_EXPRESSION_STRING_QUOTED,
27: LS_EXPRESSION_STRING_APOSTROFED,
1.48 parser 28: LS_EXPRESSION_VAR_NAME_WITH_COLON, LS_EXPRESSION_VAR_NAME_WITHOUT_COLON,
1.65 paf 29: LS_EXPRESSION_COMMENT,
1.48 parser 30: LS_VAR_NAME_SIMPLE_WITH_COLON, LS_VAR_NAME_SIMPLE_WITHOUT_COLON,
1.1 paf 31: LS_VAR_NAME_CURLY,
1.22 paf 32: LS_VAR_ROUND,
1.18 paf 33: LS_VAR_SQUARE,
1.1 paf 34: LS_VAR_CURLY,
35: LS_METHOD_NAME,
1.18 paf 36: LS_METHOD_SQUARE,
1.1 paf 37: LS_METHOD_CURLY,
1.22 paf 38: LS_METHOD_ROUND,
1.1 paf 39: LS_METHOD_AFTER
40: };
1.38 paf 41: /// compiler status
1.1 paf 42: struct parse_control {
1.38 paf 43: //@{
44: /// @name input
1.67.2.8.2.2 paf 45: Request& request;
1.67.2.7 paf 46: VStateless_class* cclass;
1.67.2.6 paf 47: const char* source;
48: const char* file;
1.4 paf 49: int line, col;
1.38 paf 50: //@}
51: //@{
52: /// @name state; initially
1.45 parser 53: bool trim_bof;
1.38 paf 54: int pending_state; ///< i=0
1.67.2.8.2.2 paf 55: StringBody string; ///< lexical string accumulator
1.1 paf 56:
57: #define MAX_LEXICAL_STATES 100
1.38 paf 58: enum lexical_state ls; ///< =LS_USER;
1.54 paf 59: int ls_sp; ///< =0
60: enum lexical_state ls_stack[MAX_LEXICAL_STATES];
1.38 paf 61: int brackets_nestages[MAX_LEXICAL_STATES]; ///< brackets nestage on each state
1.46 parser 62:
1.56 paf 63: bool in_call_value;
1.38 paf 64: //@}
1.1 paf 65:
1.36 paf 66: /// output: filled input 'methods' and 'error' if any
1.5 paf 67: char error[MAX_STRING];
1.67.2.8.2.2 paf 68:
69: parse_control(Request& arequest,
70: VStateless_class* aclass,
71: const char* asource,
72: const char* afile):
73: request(arequest), // input
74:
75: // we were told the class to compile to?
76: cclass(aclass), // until changed with @CLASS would consider operators loading
77:
78: source(asource),
79:
80: file(afile),
81: line(0), col(0),
82:
83: // initialise state
84: trim_bof(true),
85: pending_state(0),
86: ls(LS_USER),
87: ls_sp(0),
88: in_call_value(false) {
89: }
1.1 paf 90: };
91:
1.36 paf 92: /// New array // return empty array
1.67.2.8.2.2 paf 93: inline ArrayOperation* N() {
94: return new ArrayOperation;
1.3 paf 95: }
96:
1.36 paf 97: /// Assembler instruction // append ordinary instruction to ops
1.67.2.3 paf 98: inline void O(ArrayOperation& result, OPCODE code) {
99: result+=Operation(code);
1.3 paf 100: }
101:
1.36 paf 102: /// aPpend 'code_array' to 'result'
1.67.2.4 paf 103: inline void P(ArrayOperation& result, ArrayOperation& code_array) {
104: result.append(code_array);
1.11 paf 105: }
1.36 paf 106: /// aPpend part of 'code_array', starting from offset, to 'result'
1.67.2.4 paf 107: inline void P(ArrayOperation& result, ArrayOperation& code_array, int offset) {
108: result.append(code_array, offset);
1.3 paf 109: }
1.53 paf 110:
1.36 paf 111: /// aPpend 'vstring' to 'result'
1.67.2.8.2.2 paf 112: inline void PV(ArrayOperation& result, Value* value) {
1.67.2.3 paf 113: result+=Operation(OP_VALUE); // append OP_VALUE
114: result+=Operation(value); // append 'value'
1.67.2.2 paf 115: }
1.61 paf 116:
1.67.2.2 paf 117: /// append cOde Array
1.67.2.8.2.2 paf 118: inline void OA(ArrayOperation& result, OPCODE code, ArrayOperation* code_array) {
1.67.2.3 paf 119: result+=Operation(code); // append OP_CODE
120: result+=Operation(code_array); // append 'code_array'
1.61 paf 121: }
1.1 paf 122:
1.36 paf 123: /**
124: Value Literal // returns array with
125: - first: OP_VALUE instruction
126: - second op: string itself
127: */
1.67.2.8.2.2 paf 128: inline ArrayOperation* VL(Value* value) {
1.61 paf 129: // empty ops array
1.67.2.8.2.2 paf 130: ArrayOperation* result=N();
1.61 paf 131:
132: // append 'value' to 'result'
1.67.2.3 paf 133: PV(*result, value);
1.61 paf 134:
135: return result;
136: }
137:
1.36 paf 138: /// Literal Array to(2) Value @return Value from literal Array OP+Value
1.67.2.8.2.2 paf 139: Value* LA2V(ArrayOperation& literal_string_array, int offset=0);
1.36 paf 140: /// Literal Array to(2) String @return String value from literal Array OP+String array
1.67.2.8.2.2 paf 141: inline const String* LA2S(ArrayOperation& literal_string_array, int offset=0) {
142: if(Value* value=LA2V(literal_string_array, offset))
143: return value->get_string();
1.67.2.8.2.1 paf 144: return 0;
1.36 paf 145: }
1.61 paf 146:
1.67.2.3 paf 147: inline void change_string_literal_to_write_string_literal(ArrayOperation& literal_string_array) {
148: literal_string_array[0].code=OP_STRING__WRITE;
1.61 paf 149: }
150:
151:
1.67.2.3 paf 152: void change_string_literal_to_double_literal(ArrayOperation& literal_string_array);
153:
1.67.2.8.2.1 paf 154: void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value);
1.67.2.3 paf 155:
156: void changetail_or_append(ArrayOperation& opcodes,
157: OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound);
1.64 paf 158:
1.1 paf 159:
1.35 paf 160: void push_LS(parse_control& pc, lexical_state new_state);
161: void pop_LS(parse_control& pc);
1.1 paf 162:
163: #endif
E-mail: