Annotation of parser3/src/main/compile_tools.h, revision 1.78
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.78 ! misha 11: static const char * const IDENT_COMPILE_TOOLS_H="$Date: 2005/12/09 07:18:07 $";
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.78 ! misha 65: ArrayClass* cclasses;
1.68 paf 66: const char* source;
67: uint file_no;
68: Pos pos;
1.38 paf 69: //@}
70: //@{
71: /// @name state; initially
1.45 parser 72: bool trim_bof;
1.38 paf 73: int pending_state; ///< i=0
1.69 paf 74: String::Body string; ///< lexical string accumulator
1.68 paf 75: Pos string_start;
1.1 paf 76:
77: #define MAX_LEXICAL_STATES 100
1.38 paf 78: enum lexical_state ls; ///< =LS_USER;
1.54 paf 79: int ls_sp; ///< =0
80: enum lexical_state ls_stack[MAX_LEXICAL_STATES];
1.38 paf 81: int brackets_nestages[MAX_LEXICAL_STATES]; ///< brackets nestage on each state
1.46 parser 82:
1.56 paf 83: bool in_call_value;
1.74 paf 84: bool explicit_result;
1.38 paf 85: //@}
1.1 paf 86:
1.36 paf 87: /// output: filled input 'methods' and 'error' if any
1.5 paf 88: char error[MAX_STRING];
1.68 paf 89:
90: Parse_control(Request& arequest,
91: VStateless_class* aclass,
92: const char* asource, const String* amain_alias,
1.73 paf 93: uint afile_no,
94: int line_no_offset):
1.70 paf 95: main_alias(amain_alias),
96: last_line_end_col(0),
97:
1.68 paf 98: request(arequest), // input
99:
100: // we were told the class to compile to?
101: cclass(aclass), // until changed with @CLASS would consider operators loading
1.78 ! misha 102: cclasses(new ArrayClass(1)),
1.70 paf 103: source(asource),
1.68 paf 104: file_no(afile_no),
1.73 paf 105: pos(line_no_offset, 0),
1.68 paf 106:
107: // initialize state
108: trim_bof(true),
109: pending_state(0),
110: ls(LS_USER),
111: ls_sp(0),
1.74 paf 112: in_call_value(false),
1.78 ! misha 113: explicit_result(false) {
! 114:
! 115: *cclasses+=aclass;
! 116: }
1.68 paf 117:
118: void pos_next_line() {
119: pos.line++;
120: last_line_end_col=pos.col;
121: pos.col=0;
122: }
1.77 paf 123: void pos_next_c(int c) {
1.68 paf 124: if(c=='\t')
125: pos.col=(pos.col+TAB_SIZE)&~(TAB_SIZE-1);
126: else
127: pos.col++;
128: }
129: /// not precise in case of \t in the middle of the text
130: void pos_prev_c() {
131: if(pos.col==0) {
132: --pos.line; pos.col=last_line_end_col;
133: } else
134: --pos.col;
135: }
136: void ungetc() {
137: source--;
138: pos_prev_c();
139: }
1.1 paf 140: };
141:
1.36 paf 142: /// New array // return empty array
1.68 paf 143: inline ArrayOperation* N() {
144: return new ArrayOperation;
1.3 paf 145: }
146:
1.36 paf 147: /// Assembler instruction // append ordinary instruction to ops
1.68 paf 148: inline void O(ArrayOperation& result, OPCODE code) {
149: result+=Operation(code);
1.3 paf 150: }
151:
1.36 paf 152: /// aPpend 'code_array' to 'result'
1.68 paf 153: inline void P(ArrayOperation& result, ArrayOperation& code_array) {
154: result.append(code_array);
1.11 paf 155: }
1.36 paf 156: /// aPpend part of 'code_array', starting from offset, to 'result'
1.68 paf 157: inline void P(ArrayOperation& result, ArrayOperation& code_array, int offset) {
158: result.append(code_array, offset);
1.3 paf 159: }
1.53 paf 160:
1.68 paf 161: /// append cOde Array
162: inline void OA(ArrayOperation& result, OPCODE code, ArrayOperation* code_array) {
163: result+=Operation(code); // append OP_CODE
164: result+=Operation(code_array); // append 'code_array'
1.61 paf 165: }
1.1 paf 166:
1.36 paf 167: /**
168: Value Literal // returns array with
1.68 paf 169: - first op: OP_VALUE instruction
170: - second op: origin (debug information)
171: - third op: string itself
1.36 paf 172: */
1.68 paf 173: inline ArrayOperation* VL(Value* value, uint file_no, uint line, uint col) {
1.61 paf 174: // empty ops array
1.68 paf 175: ArrayOperation& result=*N();
1.61 paf 176:
177: // append 'value' to 'result'
1.68 paf 178: result+=Operation(OP_VALUE);
179: result+=Operation(file_no, line, col); // append origin
180: result+=Operation(value); // append 'value'
181:
182: return &result;
1.61 paf 183: }
184:
1.68 paf 185: /// Literal Array to(2) Value @return Value from literal Array OP+origin+Value
186: Value* LA2V(ArrayOperation& literal_string_array, int offset=0);
187: /// Literal Array to(2) String @return String value from literal Array OP+origin+String array
188: inline const String* LA2S(ArrayOperation& literal_string_array, int offset=0) {
189: if(Value* value=LA2V(literal_string_array, offset))
1.37 paf 190: return value->get_string();
191: return 0;
1.36 paf 192: }
1.61 paf 193:
1.68 paf 194: inline void change_string_literal_to_write_string_literal(ArrayOperation& literal_string_array) {
195: literal_string_array.put(0, OP_STRING__WRITE);
1.61 paf 196: }
197:
1.68 paf 198:
1.75 paf 199: void maybe_change_string_literal_to_double_literal(ArrayOperation& literal_string_array);
1.68 paf 200:
201: void change_string_literal_value(ArrayOperation& literal_string_array, const String& new_value);
202:
203: void changetail_or_append(ArrayOperation& opcodes,
1.61 paf 204: OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound);
205:
1.1 paf 206:
1.68 paf 207: void push_LS(Parse_control& pc, lexical_state new_state);
208: void pop_LS(Parse_control& pc);
1.1 paf 209:
210: #endif
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to compile_tools.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main