| | |
| | | /*- |
| | | * Copyright (c) 2012-2013 Jan Breuer, |
| | | * BSD 2-Clause License |
| | | * |
| | | * All Rights Reserved |
| | | * |
| | | * Copyright (c) 2012-2018, Jan Breuer |
| | | * All rights reserved. |
| | | * |
| | | * Redistribution and use in source and binary forms, with or without |
| | | * modification, are permitted provided that the following conditions are |
| | | * met: |
| | | * 1. Redistributions of source code must retain the above copyright notice, |
| | | * this list of conditions and the following disclaimer. |
| | | * 2. Redistributions in binary form must reproduce the above copyright |
| | | * notice, this list of conditions and the following disclaimer in the |
| | | * documentation and/or other materials provided with the distribution. |
| | | * |
| | | * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR |
| | | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
| | | * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| | | * DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE |
| | | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| | | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| | | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| | | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, |
| | | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE |
| | | * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN |
| | | * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| | | * modification, are permitted provided that the following conditions are met: |
| | | * |
| | | * * Redistributions of source code must retain the above copyright notice, this |
| | | * list of conditions and the following disclaimer. |
| | | * |
| | | * * Redistributions in binary form must reproduce the above copyright notice, |
| | | * this list of conditions and the following disclaimer in the documentation |
| | | * and/or other materials provided with the distribution. |
| | | * |
| | | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| | | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
| | | * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE |
| | | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
| | | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
| | | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
| | | * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| | | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| | | */ |
| | | |
| | | /** |
| | |
| | | |
| | | /* skip characters */ |
| | | /* 7.4.1 <PROGRAM MESSAGE UNIT SEPARATOR>*/ |
| | | // TODO: static int skipProgramMessageUnitSeparator(lex_state_t * state) |
| | | /* TODO: static int skipProgramMessageUnitSeparator(lex_state_t * state) */ |
| | | |
| | | /** |
| | | * Skip all whitespaces |
| | |
| | | } |
| | | |
| | | /* 7.4.2 <PROGRAM DATA SEPARATOR> */ |
| | | // static int skipProgramDataSeparator(lex_state_t * state) |
| | | /* static int skipProgramDataSeparator(lex_state_t * state) */ |
| | | |
| | | /* 7.5.2 <PROGRAM MESSAGE TERMINATOR> */ |
| | | // static int skipProgramMessageTerminator(lex_state_t * state) |
| | | /* static int skipProgramMessageTerminator(lex_state_t * state) */ |
| | | |
| | | /** |
| | | * Skip decimal digit |
| | |
| | | * @return |
| | | */ |
| | | static int skipDigit(lex_state_t * state) { |
| | | if (!iseos(state) && isdigit(state->pos[0])) { |
| | | if (!iseos(state) && isdigit((uint8_t)(state->pos[0]))) { |
| | | state->pos++; |
| | | return SKIP_OK; |
| | | } else { |
| | |
| | | */ |
| | | static int skipNumbers(lex_state_t * state) { |
| | | int someNumbers = 0; |
| | | while (!iseos(state) && isdigit(state->pos[0])) { |
| | | while (!iseos(state) && isdigit((uint8_t)(state->pos[0]))) { |
| | | state->pos++; |
| | | someNumbers++; |
| | | } |
| | |
| | | */ |
| | | static int skipAlpha(lex_state_t * state) { |
| | | int someLetters = 0; |
| | | while (!iseos(state) && isalpha(state->pos[0])) { |
| | | while (!iseos(state) && isalpha((uint8_t)(state->pos[0]))) { |
| | | state->pos++; |
| | | someLetters++; |
| | | } |
| | |
| | | */ |
| | | static int skipProgramMnemonic(lex_state_t * state) { |
| | | const char * startPos = state->pos; |
| | | if (!iseos(state) && isalpha(state->pos[0])) { |
| | | if (!iseos(state) && isalpha((uint8_t)(state->pos[0]))) { |
| | | state->pos++; |
| | | while (!iseos(state) && (isalnum(state->pos[0]) || ischr(state, '_'))) { |
| | | while (!iseos(state) && (isalnum((uint8_t)(state->pos[0])) || ischr(state, '_'))) { |
| | | state->pos++; |
| | | } |
| | | } |
| | |
| | | token->type = SCPI_TOKEN_UNKNOWN; |
| | | } |
| | | |
| | | return token->len; |
| | | return token->len; |
| | | |
| | | |
| | | } |
| | | |
| | | /* 7.6.1 <COMMAND PROGRAM HEADER> */ |
| | |
| | | * @param token |
| | | * @return |
| | | */ |
| | | |
| | | /*识别和分类SCPI命令头 |
| | | 公共命令头 以*识别 如 *IDN? |
| | | 复合命令头 以:识别 如 SYSTem:ERRor? |
| | | 命令查询 以?识别 |
| | | 普通命令:MEAS:VOLT |
| | | 查询命令:MEAS:VOLT? |
| | | */ |
| | | int scpiLex_ProgramHeader(lex_state_t * state, scpi_token_t * token) { |
| | | |
| | | // 记录起始位置 并且初始化类型 |
| | | int res; |
| | | token->ptr = state->pos; |
| | | token->type = SCPI_TOKEN_UNKNOWN; |
| | | |
| | | res = skipCommonProgramHeader(state); |
| | | // 解析到公共命令头后检查查询符 |
| | | if (res >= SKIP_OK) { |
| | | if (skipChr(state, '?') >= SKIP_OK) { |
| | | token->type = SCPI_TOKEN_COMMON_QUERY_PROGRAM_HEADER; |
| | |
| | | } else if (res <= SKIP_INCOMPLETE) { |
| | | token->type = SCPI_TOKEN_INCOMPLETE_COMMON_PROGRAM_HEADER; |
| | | } else if (res == SKIP_NONE) { |
| | | |
| | | // 解析到复合命令后检查查询符 |
| | | res = skipCompoundProgramHeader(state); |
| | | |
| | | if (res >= SKIP_OK) { |
| | |
| | | token->type = SCPI_TOKEN_INCOMPLETE_COMPOUND_PROGRAM_HEADER; |
| | | } |
| | | } |
| | | |
| | | // 计算长度 |
| | | if (token->type != SCPI_TOKEN_UNKNOWN) { |
| | | token->len = state->pos - token->ptr; |
| | | } else { |
| | |
| | | int scpiLex_CharacterProgramData(lex_state_t * state, scpi_token_t * token) { |
| | | token->ptr = state->pos; |
| | | |
| | | if (!iseos(state) && isalpha(state->pos[0])) { |
| | | if (!iseos(state) && isalpha((uint8_t)(state->pos[0]))) { |
| | | state->pos++; |
| | | while (!iseos(state) && (isalnum(state->pos[0]) || ischr(state, '_'))) { |
| | | while (!iseos(state) && (isalnum((uint8_t)(state->pos[0])) || ischr(state, '_'))) { |
| | | state->pos++; |
| | | } |
| | | } |
| | |
| | | |
| | | skipChr(state, '/'); |
| | | |
| | | // TODO: strict parsing : SLASH? (ALPHA+ (MINUS? DIGIT)?) ((SLASH | DOT) (ALPHA+ (MINUS? DIGIT)?))* |
| | | /* TODO: strict parsing : SLASH? (ALPHA+ (MINUS? DIGIT)?) ((SLASH | DOT) (ALPHA+ (MINUS? DIGIT)?))* */ |
| | | if (skipAlpha(state)) { |
| | | skipChr(state, '-'); |
| | | skipDigit(state); |
| | |
| | | /* 7.7.4 <NONDECIMAL NUMERIC PROGRAM DATA> */ |
| | | static int skipHexNum(lex_state_t * state) { |
| | | int someNumbers = 0; |
| | | while (!iseos(state) && isxdigit(state->pos[0])) { |
| | | while (!iseos(state) && isxdigit((uint8_t)(state->pos[0]))) { |
| | | state->pos++; |
| | | someNumbers++; |
| | | } |
| | |
| | | } |
| | | |
| | | if (someNumbers) { |
| | | token->ptr += 2; // ignore number prefix |
| | | token->ptr += 2; /* ignore number prefix */ |
| | | token->len = state->pos - token->ptr; |
| | | } else { |
| | | token->type = SCPI_TOKEN_UNKNOWN; |
| | |
| | | token->len = state->pos - token->ptr; |
| | | |
| | | if ((token->len > 0)) { |
| | | //token->ptr++; |
| | | //token->len -= 2; |
| | | /* token->ptr++; |
| | | * token->len -= 2; */ |
| | | } else { |
| | | token->type = SCPI_TOKEN_UNKNOWN; |
| | | state->pos = token->ptr; |
| | |
| | | state->pos++; |
| | | |
| | | for (; i > 0; i--) { |
| | | if (!iseos(state) && isdigit(state->pos[0])) { |
| | | if (!iseos(state) && isdigit((uint8_t)(state->pos[0]))) { |
| | | arbitraryBlockLength *= 10; |
| | | arbitraryBlockLength += (state->pos[0] - '0'); |
| | | state->pos++; |
| | |
| | | token->ptr = state->pos - arbitraryBlockLength; |
| | | token->len = arbitraryBlockLength; |
| | | validData = 1; |
| | | } else { |
| | | validData = 0; |
| | | } |
| | | } else if (iseos(state)) { |
| | | validData = 0; |
| | |
| | | } |
| | | |
| | | if (validData == 1) { |
| | | // valid |
| | | /* valid */ |
| | | token->type = SCPI_TOKEN_ARBITRARY_BLOCK_PROGRAM_DATA; |
| | | } else if (validData == 0) { |
| | | // incomplete |
| | | /* incomplete */ |
| | | token->type = SCPI_TOKEN_UNKNOWN; |
| | | token->len = 0; |
| | | state->pos = state->buffer + state->len; |
| | | } else { |
| | | // invalid |
| | | /* invalid */ |
| | | token->type = SCPI_TOKEN_UNKNOWN; |
| | | state->pos = token->ptr; |
| | | token->len = 0; |
| | |
| | | } |
| | | } |
| | | |
| | | // TODO: 7.7.7.2-2 recursive - any program data |
| | | /* TODO: 7.7.7.2-2 recursive - any program data */ |
| | | |
| | | /** |
| | | * Detect token Expression |