Annotation of parser3/src/main/compile_tools.h, revision 1.79
1.32 paf 1: /** @file
1.33 paf 2: Parser: compiler support helper functions decls.
3:
1.76 paf 4: Copyright (c) 2001-2005 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.79 ! misha 11: static const char * const IDENT_COMPILE_TOOLS_H="$Date: 2008-06-10 14:06:36 $";
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.1 paf 17:
1.68 paf 18: /// used to track source column number
19: #define TAB_SIZE 8
20:
1.1 paf 21: enum lexical_state {
1.48 parser 22: LS_USER, LS_NAME_SQUARE_PART,
1.65 paf 23: LS_USER_COMMENT,
1.7 paf 24: LS_DEF_NAME,
25: LS_DEF_PARAMS,
26: LS_DEF_LOCALS,
27: LS_DEF_COMMENT,
1.18 paf 28: LS_DEF_SPECIAL_BODY,
1.42 parser 29: LS_EXPRESSION_STRING_QUOTED,
30: LS_EXPRESSION_STRING_APOSTROFED,
1.48 parser 31: LS_EXPRESSION_VAR_NAME_WITH_COLON, LS_EXPRESSION_VAR_NAME_WITHOUT_COLON,
1.65 paf 32: LS_EXPRESSION_COMMENT,
1.48 parser 33: LS_VAR_NAME_SIMPLE_WITH_COLON, LS_VAR_NAME_SIMPLE_WITHOUT_COLON,
1.1 paf 34: LS_VAR_NAME_CURLY,
1.22 paf 35: LS_VAR_ROUND,
1.18 paf 36: LS_VAR_SQUARE,
1.1 paf 37: LS_VAR_CURLY,
38: LS_METHOD_NAME,
1.18 paf 39: LS_METHOD_SQUARE,
1.1 paf 40: LS_METHOD_CURLY,
1.22 paf 41: LS_METHOD_ROUND,
1.1 paf 42: LS_METHOD_AFTER
43: };
1.68 paf 44:
45: struct Pos {
1.73 paf 46: int line;
47: int col;
48: Pos(int aline, int acol): line(aline), col(acol) {}
1.68 paf 49: Pos(): line(0), col(0) {}
50:
51: void clear() { line=col=0; }
52: operator bool() { return col!=0; }
53: };
54:
1.38 paf 55: /// compiler status
1.68 paf 56: class Parse_control {
57: const String* main_alias;
58: uint last_line_end_col;
59: public:
60: const String& alias_method(const String& name);
1.38 paf 61: //@{
62: /// @name input
1.68 paf 63: Request& request;
64: VStateless_class* cclass;
1.79 ! misha 65: VStateless_class* cclass_new;
1.78 misha 66: ArrayClass* cclasses;
1.68 paf 67: const char* source;
68: uint file_no;
69: Pos pos;
1.38 paf 70: //@}
71: //@{
72: /// @name state; initially
1.45 parser 73: bool trim_bof;
1.38 paf 74: int pending_state; ///< i=0
1.69 paf 75: String::Body string; ///< lexical string accumulator
1.68 paf 76: Pos string_start;
1.1 paf 77:
78: #define MAX_LEXICAL_STATES 100
1.38 paf 79: enum lexical_state ls; ///< =LS_USER;
1.54 paf 80: int ls_sp; ///< =0
81: enum lexical_state ls_stack[MAX_LEXICAL_STATES];
1.38 paf 82: int brackets_nestages[MAX_LEXICAL_STATES]; ///< brackets nestage on each state
1.46 parser 83:
1.56 paf 84: bool in_call_value;
1.74 paf 85: bool explicit_result;
1.79 ! misha 86: bool append;
1.38 paf 87: //@}
1.1 paf 88:
1.36 paf 89: /// output: filled input 'methods' and 'error' if any
1.5 paf 90: char error[MAX_STRING];
1.68 paf 91:
92: Parse_control(Request& arequest,
93: VStateless_class* aclass,
94: const char* asource, const String* amain_alias,
1.73 paf 95: uint afile_no,
96: int line_no_offset):
1.70 paf 97: main_alias(amain_alias),
98: last_line_end_col(0),
99:
1.68 paf 100: request(arequest), // input
101:
102: // we were told the class to compile to?
103: cclass(aclass), // until changed with @CLASS would consider operators loading
1.79 ! misha 104: cclass_new(0),
1.78 misha 105: cclasses(new ArrayClass(1)),
1.70 paf 106: source(asource),
1.68 paf 107: file_no(afile_no),
1.73 paf 108: pos(line_no_offset, 0),
1.68 paf 109:
110: // initialize state
111: trim_bof(true),
112: pending_state(0),
113: ls(LS_USER),
114: ls_sp(0),
1.74 paf 115: in_call_value(false),
1.79 ! misha 116: explicit_result(false),
! 117: append(false) {
1.78 misha 118:
119: *cclasses+=aclass;
120: }
1.68 paf 121:
1.79 ! misha 122: void class_add(){
! 123: if(cclass_new){
! 124: cclass=cclass_new;
! 125: // append to request's classes
! 126: request.classes().put(cclass->name(), cclass);
! 127: *cclasses+=cclass;
! 128: cclass_new=0;
! 129: append=false;
! 130: }
! 131: }
! 132:
! 133: bool class_reuse(){
! 134: if(cclass_new){
! 135: if(Value* class_value=request.classes().get(cclass_new->name())){
! 136: if(VStateless_class* existed_class=class_value->get_class()) {
! 137: cclass=existed_class;
! 138: cclass_new=0;
! 139: append=true;
! 140: return true;
! 141: } else {
! 142: return false;
! 143: }
! 144: }
! 145: }
! 146: return false;
! 147: }
! 148:
! 149: void set_all_vars_local(){
! 150: if(cclass_new){
! 151: cclass_new->all_vars_local();
! 152: } else {
! 153: cclass->all_vars_local();
! 154: }
! 155: }
! 156:
1.68 paf 157: void pos_next_line() {
158: pos.line++;
159: last_line_end_col=pos.col;
160: pos.col=0;
161: }
1.77 paf 162: void pos_next_c(int c) {
1.68 paf 163: if(c=='\t')
164: pos.col=(pos.col+TAB_SIZE)&~(TAB_SIZE-1);
165: else
166: pos.col++;
167: }
168: /// not precise in case of \t in the middle of the text
169: void pos_prev_c() {
170: if(pos.col==0) {
171: --pos.line; pos.col=last_line_end_col;
172: } else
173: --pos.col;
174: }
175: void ungetc() {
176: source--;
177: pos_prev_c();
178: }
1.1 paf 179: };
180:
1.36 paf 181: /// New array // return empty array
1.68 paf 182: inline ArrayOperation* N() {
183: return new ArrayOperation;
1.3 paf 184: }
185:
1.36 paf 186: /// Assembler instruction // append ordinary instruction to ops
1.68 paf 187: inline void O(ArrayOperation& result, OPCODE code) {
188: result+=Operation(code);
1.3 paf 189: }
190:
1.36 paf 191: /// aPpend 'code_array' to 'result'
1.68 paf 192: inline void P(ArrayOperation& result, ArrayOperation& code_array) {
193: result.append(code_array);
1.11 paf 194: }
1.36 paf 195: /// aPpend part of 'code_array', starting from offset, to 'result'
1.68 paf 196: inline void P(ArrayOperation& result, ArrayOperation& code_array, int offset) {
197: result.append(code_array, offset);
1.3 paf 198: }
1.53 paf 199:
1.68 paf 200: /// append cOde Array
201: inline void OA(ArrayOperation& result, OPCODE code, ArrayOperation* code_array) {
202: result+=Operation(code); // append OP_CODE
203: result+=Operation(code_array); // append 'code_array'
1.61 paf 204: }
1.1 paf 205:
1.36 paf 206: /**
207: Value Literal // returns array with
1.68 paf 208: - first op: OP_VALUE instruction
209: - second op: origin (debug information)
210: - third op: string itself
1.36 paf 211: */
1.68 paf 212: inline ArrayOperation* VL(Value* value, uint file_no, uint line, uint col) {
1.61 paf 213: // empty ops array
1.68 paf 214: ArrayOperation& result=*N();
1.61 paf 215:
216: // append 'value' to 'result'
1.68 paf 217: result+=Operation(OP_VALUE);
218: result+=Operation(file_no, line, col); // append origin
219: result+=Operation(value); // append 'value'
220:
221: return &result;
1.61 paf 222: }
223:
1.68 paf 224: /// Literal Array to(2) Value @return Value from literal Array OP+origin+Value
225: Value* LA2V(ArrayOperation& literal_string_array, int offset=0);
226: /// Literal Array to(2) String @return String value from literal Array OP+origin+String array
227: inline const String* LA2S(ArrayOperation& literal_string_array, int offset=0) {
228: if(Value* value=LA2V(literal_string_array, offset))
1.37 paf 229: return value->get_string();
230: return 0;
1.36 paf 231: }
1.61 paf 232:
1.68 paf 233: inline void change_string_literal_to_write_string_literal(ArrayOperation& literal_string_array) {
234: literal_string_array.put(0, OP_STRING__WRITE);
1.61 paf 235: }
236:
1.68 paf 237:
1.75 paf 238: void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_string_array);
1.68 paf 239:
240: void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value);
241:
242: void changetail_or_append(ArrayOperation& opcodes,
1.61 paf 243: OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound);
244:
1.1 paf 245:
1.68 paf 246: void push_LS(Parse_control& pc, lexical_state new_state);
247: void pop_LS(Parse_control& pc);
1.1 paf 248:
249: #endif
E-mail: