Resolve #65: Infinite loop with non ASCII character
| | |
| | | state->pos--; |
| | | break; |
| | | } |
| | | } else { |
| | | break; |
| | | } |
| | | } |
| | | } |
| | |
| | | TEST_TOKEN("'ah\"oj' ", scpiParser_parseProgramData, 0, 7, SCPI_TOKEN_SINGLE_QUOTE_PROGRAM_DATA); |
| | | TEST_TOKEN("\"ah\"\"oj\" ", scpiParser_parseProgramData, 0, 8, SCPI_TOKEN_DOUBLE_QUOTE_PROGRAM_DATA); |
| | | TEST_TOKEN("\"\"", scpiParser_parseProgramData, 0, 2, SCPI_TOKEN_DOUBLE_QUOTE_PROGRAM_DATA); |
| | | TEST_TOKEN("'test\r\n' ", scpiParser_parseProgramData, 0, 8, SCPI_TOKEN_SINGLE_QUOTE_PROGRAM_DATA); |
| | | TEST_TOKEN("'\xFA\xF0' ", scpiParser_parseProgramData, 0, 0, SCPI_TOKEN_UNKNOWN); |
| | | |
| | | TEST_TOKEN("abc_213as564 , ", scpiLex_CharacterProgramData, 0, 12, SCPI_TOKEN_PROGRAM_MNEMONIC); |
| | | |
| | |
| | | TEST_INPUT("TEST:TREEA?;:TEXT? \"PARAM1\", \"PARAM2\"\r\n", "10;\"PARAM2\"\r\n"); |
| | | output_buffer_clear(); |
| | | |
| | | /* Test special characters in parameters */ |
| | | TEST_INPUT("TEXT? \"\", \"test\r\n\"\r\n", "\"test\r\n\"\r\n"); |
| | | output_buffer_clear(); |
| | | |
| | | CU_ASSERT_EQUAL(err_buffer_pos, 0); |
| | | error_buffer_clear(); |
| | | } |