Annotation of parser3/src/main/compile_tools.h, revision 1.67.2.2
1.32 paf 1: /** @file
1.33 paf 2: Parser: compiler support helper functions decls.
3:
1.67 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.2! paf 11: static const char* IDENT_COMPILE_TOOLS_H="$Date: 2003/01/30 09:14:01 $";
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:
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.3 paf 45: Pool *pool;
1.14 paf 46: Request *request;
1.30 paf 47: VStateless_class *cclass;
1.66 paf 48: #ifndef NO_STRING_ORIGIN
1.29 paf 49: const char *source;
50: const char *file;
1.44 parser 51: #endif
1.4 paf 52: int line, col;
1.38 paf 53: //@}
54: //@{
55: /// @name state; initially
1.45 parser 56: bool trim_bof;
1.38 paf 57: int pending_state; ///< i=0
1.67.2.1 paf 58: StringPtr string; ///< lexical string accumulator
1.1 paf 59:
60: #define MAX_LEXICAL_STATES 100
1.38 paf 61: enum lexical_state ls; ///< =LS_USER;
1.54 paf 62: int ls_sp; ///< =0
63: enum lexical_state ls_stack[MAX_LEXICAL_STATES];
1.38 paf 64: int brackets_nestages[MAX_LEXICAL_STATES]; ///< brackets nestage on each state
1.46 parser 65:
1.56 paf 66: bool in_call_value;
1.38 paf 67: //@}
1.1 paf 68:
1.36 paf 69: /// output: filled input 'methods' and 'error' if any
1.5 paf 70: char error[MAX_STRING];
1.1 paf 71: };
72:
1.36 paf 73: /// New array // return empty array
1.67.2.2! paf 74: inline ArrayOperation* N() {
! 75: return new ArrayOperation;
1.3 paf 76: }
77:
1.36 paf 78: /// Assembler instruction // append ordinary instruction to ops
1.67.2.2! paf 79: inline void O(ArrayOperation* result, OPCODE code) {
! 80: *result+=Operation(code);
1.3 paf 81: }
82:
1.36 paf 83: /// aPpend 'code_array' to 'result'
1.67.2.2! paf 84: inline void P(ArrayOperation* result, ArrayOperation* code_array) {
! 85: result->append(*code_array);
1.11 paf 86: }
1.36 paf 87: /// aPpend part of 'code_array', starting from offset, to 'result'
1.67.2.2! paf 88: inline void P(ArrayOperation* result, ArrayOperation* code_array, int offset) {
! 89: result->append(*code_array, offset);
1.3 paf 90: }
1.53 paf 91:
1.36 paf 92: /// aPpend 'vstring' to 'result'
1.67.2.2! paf 93: inline void PV(ArrayOperation* result, Value* value) {
! 94: *result+=Operation(OP_VALUE); // append OP_VALUE
! 95: *result+=Operation(value); // append 'value'
! 96: }
1.61 paf 97:
1.67.2.2! paf 98: /// append cOde Array
! 99: inline void OA(ArrayOperation* result, OPCODE opcode, ArrayOperation* code_array) {
! 100: *result+=Operation(opcode); // append OP_CODE
! 101: *result+=Operation(code_array); // append 'code_array'
1.61 paf 102: }
1.1 paf 103:
1.36 paf 104: /**
105: Value Literal // returns array with
106: - first: OP_VALUE instruction
107: - second op: string itself
108: */
1.67.2.2! paf 109: inline ArrayOperation* VL(Value* value) {
1.61 paf 110: // empty ops array
1.67.2.2! paf 111: ArrayOperation* result=N();
1.61 paf 112:
113: // append 'value' to 'result'
114: PV(result, value);
115:
116: return result;
117: }
118:
1.36 paf 119: /// Literal Array to(2) Value @return Value from literal Array OP+Value
1.67.2.2! paf 120: Value* LA2V(ArrayOperation* literal_string_array, int offset=0);
1.36 paf 121: /// Literal Array to(2) String @return String value from literal Array OP+String array
1.67.2.2! paf 122: inline const String *LA2S(ArrayOperation* literal_string_array, int offset=0) {
! 123: if(Value* value=LA2V(literal_string_array, offset))
1.37 paf 124: return value->get_string();
125: return 0;
1.36 paf 126: }
1.61 paf 127:
1.67.2.2! paf 128: inline void change_string_literal_to_write_string_literal(ArrayOperation* literal_string_array) {
1.61 paf 129: Operation op; op.code=OP_STRING__WRITE;
130: literal_string_array->put(0, op.cast);
131: }
132:
1.67.2.2! paf 133: void changetail_or_append(ArrayOperation* opcodes,
1.61 paf 134: OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound);
135:
1.67.2.2! paf 136: void change_string_literal_to_double_literal(ArrayOperation* literal_string_array);
1.64 paf 137:
1.67.2.2! paf 138: void change_string_literal_value(ArrayOperation* literal_string_array, const String& new_value);
1.1 paf 139:
1.35 paf 140: void push_LS(parse_control& pc, lexical_state new_state);
141: void pop_LS(parse_control& pc);
1.1 paf 142:
143: #endif
E-mail: