конечный автомат на си 2026

c\n"
"enum state { IDLE, HEADER, BODY, ERROR };\n"
"enum state current = IDLE;\n\n"
"void process(char c) {\n"
" switch (current) {\n"
" case ID:LE:\n"
" if (c == '\\r') current = HEADER;\n"
" break;\n"
" case HEADER:\n"
" if (c == '\\n') current = BODY;\n"
" else if (!isprint(c)) current = ERROR;\n"
" break;\n"
" // ... и так далее\n"
" }\n"
"}\n"
"c\n"
"#include \n"
"#include \n"
"#include \n\n"
"typedef enum {\n"
" S_START, S_METHOD, S_SPACE, S_URI, S_HTTP_VER, S_CR, S_LF, S_HEADER_NAME,\n"
" S_HEADER_COLON, S_HEADER_VALUE, S_HEADER_CR, S_HEADER_LF, S_BODY, S_ERROR\n"
"} http_state_t;\n\n"
"typedef struct {\n"
" http_state_t next;\n"
" void (action)(char c, void ctx);\n"
"} transition_t;\n\n"
"// Пример действия: накопление метода\n"
"void accumulate_method(char c, void ctx) {\n"
" // ctx указывает на буфер запроса\n"
"}\n\n"
"// Таблица переходов (упрощённая)\n"
"transition_t table[14][128]; // 14 состояний, ASCII 0-127\n\n"
"void init_http_fsm() {\n"
" // Инициализация всех ячеек в S_ERROR\n"
" for (int s = 0; s < 14; s++)\n"
" for (int c = 0; c < 128; c++)\n"
" table[s][c] = (transition_t){S_ERROR, NULL};\n\n"
" // Переходы из S_START\n"
" for (int c = 'A'; c <= 'Z'; c++)\n"
" table[S_START][c] = (transition_t){S_METHOD, accumulate_method};\n"
" \n"
" // ... остальные переходы\n"
"}\n\n"
"http_state_t http_process(http_state_t current, char c, void ctx) {\n"
" if (c < 0 || c > 127) return S_ERROR;\n"
" transition_t tr = table[current][c];\n"
" if (tr.action) tr.action(c, ctx);\n"
" return tr.next;\n"
"}\n"
"

Telegram: https://t.me/+W5ms_rHT8lRlOWY5