|
|
| version 1.45, 2001/07/25 12:18:23 | version 1.62, 2002/08/01 11:26:49 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: compiler support helper functions decls. | Parser: compiler support helper functions decls. |
| Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001, 2002 ArtLebedev Group (http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | |
| Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) | |
| $Id$ | |
| */ | */ |
| #ifndef COMPILE_TOOLS | #ifndef COMPILE_TOOLS |
| #define COMPILE_TOOLS | #define COMPILE_TOOLS |
| #include "pa_config_includes.h" | static const char* IDENT_COMPILE_TOOLS_H="$Id$"; |
| #include "pa_opcode.h" | #include "pa_opcode.h" |
| #include "pa_types.h" | #include "pa_types.h" |
| #include "pa_vstring.h" | #include "pa_vstring.h" |
| #include "pa_request.h" | #include "pa_request.h" |
| enum lexical_state { | enum lexical_state { |
| LS_USER, | LS_USER, LS_NAME_SQUARE_PART, |
| LS_COMMENT, | LS_COMMENT, |
| LS_DEF_NAME, | LS_DEF_NAME, |
| LS_DEF_PARAMS, | LS_DEF_PARAMS, |
| Line 27 enum lexical_state { | Line 25 enum lexical_state { |
| LS_DEF_SPECIAL_BODY, | LS_DEF_SPECIAL_BODY, |
| LS_EXPRESSION_STRING_QUOTED, | LS_EXPRESSION_STRING_QUOTED, |
| LS_EXPRESSION_STRING_APOSTROFED, | LS_EXPRESSION_STRING_APOSTROFED, |
| LS_EXPRESSION_VAR_NAME, | LS_EXPRESSION_VAR_NAME_WITH_COLON, LS_EXPRESSION_VAR_NAME_WITHOUT_COLON, |
| LS_VAR_NAME_SIMPLE, | LS_VAR_NAME_SIMPLE_WITH_COLON, LS_VAR_NAME_SIMPLE_WITHOUT_COLON, |
| LS_VAR_NAME_CURLY, | LS_VAR_NAME_CURLY, |
| LS_VAR_NAME_NO_COLON, | |
| LS_VAR_ROUND, | LS_VAR_ROUND, |
| LS_VAR_SQUARE, | LS_VAR_SQUARE, |
| LS_VAR_CURLY, | LS_VAR_CURLY, |
| Line 61 struct parse_control { | Line 58 struct parse_control { |
| #define MAX_LEXICAL_STATES 100 | #define MAX_LEXICAL_STATES 100 |
| enum lexical_state ls; ///< =LS_USER; | enum lexical_state ls; ///< =LS_USER; |
| int sp; ///< =0 | int ls_sp; ///< =0 |
| enum lexical_state stack[MAX_LEXICAL_STATES]; | enum lexical_state ls_stack[MAX_LEXICAL_STATES]; |
| int brackets_nestages[MAX_LEXICAL_STATES]; ///< brackets nestage on each state | int brackets_nestages[MAX_LEXICAL_STATES]; ///< brackets nestage on each state |
| bool in_call_value; | |
| //@} | //@} |
| /// output: filled input 'methods' and 'error' if any | /// output: filled input 'methods' and 'error' if any |
| Line 81 inline void O(Array/*<Operation>*/ *resu | Line 80 inline void O(Array/*<Operation>*/ *resu |
| *result+=op.cast; | *result+=op.cast; |
| } | } |
| /// Argument Eval_expression // append eval_expression to ops | |
| inline void AE(Array/*<Operation>*/ *result, char *eval_expression) { | |
| *result+=eval_expression; | |
| } | |
| /// aPpend 'code_array' to 'result' | /// aPpend 'code_array' to 'result' |
| inline void P(Array/*<Operation>*/ *result, Array *code_array) { | inline void P(Array/*<Operation>*/ *result, Array *code_array) { |
| result->append_array(*code_array); | result->append_array(*code_array); |
| Line 94 inline void P(Array/*<Operation>*/ *resu | Line 88 inline void P(Array/*<Operation>*/ *resu |
| inline void P(Array/*<Operation>*/ *result, Array *code_array, int offset) { | inline void P(Array/*<Operation>*/ *result, Array *code_array, int offset) { |
| result->append_array(*code_array, offset); | result->append_array(*code_array, offset); |
| } | } |
| /// aPpend 'vstring' to 'result' | /// aPpend 'vstring' to 'result' |
| void PV(Array/*<Operation>*/ *result, VString *vstring); | void PV(Array/*<Operation>*/ *result, Value *value); |
| /// Parameter 'simple Code_Array' | |
| void PCA(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array); | inline void OA(Array/*<Operation>*/ *result, OPCODE opcode, Array/*<Operation>*/ *code_array) { |
| /// Parameter 'Expression code_Array' | // append OP_CODE |
| void PEA(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array); | Operation op; op.code=opcode; |
| /// Construct 'simple Code_Array' | *result+=op.cast; |
| void CCA(Array/*<Operation>*/ *result, Array/*<Operation>*/ *code_array); | |
| // append 'vstring' | |
| *result+=code_array; | |
| } | |
| /** | /** |
| Value Literal // returns array with | Value Literal // returns array with |
| - first: OP_VALUE instruction | - first: OP_VALUE instruction |
| - second op: string itself | - second op: string itself |
| */ | */ |
| Array *VL(Value *value); | inline Array *VL(Value *value) { |
| // empty ops array | |
| Array *result=N(value->pool()); | |
| // append 'value' to 'result' | |
| PV(result, value); | |
| return result; | |
| } | |
| /// Literal Array to(2) Value @return Value from literal Array OP+Value | /// Literal Array to(2) Value @return Value from literal Array OP+Value |
| Value *LA2V(Array *literal_string_array, int offset=0); | Value *LA2V(Array *literal_string_array, int offset=0); |
| /// Literal Array to(2) String @return String value from literal Array OP+String array | /// Literal Array to(2) String @return String value from literal Array OP+String array |
| Line 117 inline const String *LA2S(Array *literal | Line 124 inline const String *LA2S(Array *literal |
| return value->get_string(); | return value->get_string(); |
| return 0; | return 0; |
| } | } |
| inline void change_string_literal_to_write_string_literal(Array *literal_string_array) { | |
| Operation op; op.code=OP_STRING__WRITE; | |
| literal_string_array->put(0, op.cast); | |
| } | |
| void changetail_or_append(Array *opcodes, | |
| OPCODE find, bool with_argument, OPCODE replace, OPCODE notfound); | |
| void change_string_literal_to_double_literal(Array *literal_string_array); | void change_string_literal_to_double_literal(Array *literal_string_array); |
| void change_string_literal_to_write_string_literal(Array *literal_string_array); | |
| void push_LS(parse_control& pc, lexical_state new_state); | void push_LS(parse_control& pc, lexical_state new_state); |
| void pop_LS(parse_control& pc); | void pop_LS(parse_control& pc); |