1
0

grammar-parser.cpp 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449
  1. #include "grammar-parser.h"
  2. #include <cstdint>
  3. #include <cwchar>
  4. #include <string>
  5. #include <utility>
  6. #include <stdexcept>
  7. #include <exception>
  8. namespace grammar_parser {
  9. // NOTE: assumes valid utf8 (but checks for overrun)
  10. // copied from llama.cpp
  11. static std::pair<uint32_t, const char *> decode_utf8(const char * src) {
  12. static const int lookup[] = { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 4 };
  13. uint8_t first_byte = static_cast<uint8_t>(*src);
  14. uint8_t highbits = first_byte >> 4;
  15. int len = lookup[highbits];
  16. uint8_t mask = (1 << (8 - len)) - 1;
  17. uint32_t value = first_byte & mask;
  18. const char * end = src + len; // may overrun!
  19. const char * pos = src + 1;
  20. for ( ; pos < end && *pos; pos++) {
  21. value = (value << 6) + (static_cast<uint8_t>(*pos) & 0x3F);
  22. }
  23. return std::make_pair(value, pos);
  24. }
  25. static uint32_t get_symbol_id(parse_state & state, const char * src, size_t len) {
  26. uint32_t next_id = static_cast<uint32_t>(state.symbol_ids.size());
  27. auto result = state.symbol_ids.emplace(std::string(src, len), next_id);
  28. return result.first->second;
  29. }
  30. static uint32_t generate_symbol_id(parse_state & state, const std::string & base_name) {
  31. uint32_t next_id = static_cast<uint32_t>(state.symbol_ids.size());
  32. state.symbol_ids[base_name + '_' + std::to_string(next_id)] = next_id;
  33. return next_id;
  34. }
  35. static void add_rule(
  36. parse_state & state,
  37. uint32_t rule_id,
  38. const std::vector<llama_grammar_element> & rule) {
  39. if (state.rules.size() <= rule_id) {
  40. state.rules.resize(rule_id + 1);
  41. }
  42. state.rules[rule_id] = rule;
  43. }
  44. static bool is_word_char(char c) {
  45. return ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || c == '-' || ('0' <= c && c <= '9');
  46. }
  47. static std::pair<uint32_t, const char *> parse_hex(const char * src, int size) {
  48. const char * pos = src;
  49. const char * end = src + size;
  50. uint32_t value = 0;
  51. for ( ; pos < end && *pos; pos++) {
  52. value <<= 4;
  53. char c = *pos;
  54. if ('a' <= c && c <= 'f') {
  55. value += c - 'a' + 10;
  56. } else if ('A' <= c && c <= 'F') {
  57. value += c - 'A' + 10;
  58. } else if ('0' <= c && c <= '9') {
  59. value += c - '0';
  60. } else {
  61. break;
  62. }
  63. }
  64. if (pos != end) {
  65. throw std::runtime_error("expecting " + std::to_string(size) + " hex chars at " + src);
  66. }
  67. return std::make_pair(value, pos);
  68. }
  69. static const char * parse_space(const char * src, bool newline_ok) {
  70. const char * pos = src;
  71. while (*pos == ' ' || *pos == '\t' || *pos == '#' ||
  72. (newline_ok && (*pos == '\r' || *pos == '\n'))) {
  73. if (*pos == '#') {
  74. while (*pos && *pos != '\r' && *pos != '\n') {
  75. pos++;
  76. }
  77. } else {
  78. pos++;
  79. }
  80. }
  81. return pos;
  82. }
  83. static const char * parse_name(const char * src) {
  84. const char * pos = src;
  85. while (is_word_char(*pos)) {
  86. pos++;
  87. }
  88. if (pos == src) {
  89. throw std::runtime_error(std::string("expecting name at ") + src);
  90. }
  91. return pos;
  92. }
  93. static std::pair<uint32_t, const char *> parse_char(const char * src) {
  94. if (*src == '\\') {
  95. switch (src[1]) {
  96. case 'x': return parse_hex(src + 2, 2);
  97. case 'u': return parse_hex(src + 2, 4);
  98. case 'U': return parse_hex(src + 2, 8);
  99. case 't': return std::make_pair('\t', src + 2);
  100. case 'r': return std::make_pair('\r', src + 2);
  101. case 'n': return std::make_pair('\n', src + 2);
  102. case '\\':
  103. case '"':
  104. case '[':
  105. case ']':
  106. return std::make_pair(src[1], src + 2);
  107. default:
  108. throw std::runtime_error(std::string("unknown escape at ") + src);
  109. }
  110. } else if (*src) {
  111. return decode_utf8(src);
  112. }
  113. throw std::runtime_error("unexpected end of input");
  114. }
  115. const char * parse_alternates(
  116. parse_state & state,
  117. const char * src,
  118. const std::string & rule_name,
  119. uint32_t rule_id,
  120. bool is_nested);
  121. static const char * parse_sequence(
  122. parse_state & state,
  123. const char * src,
  124. const std::string & rule_name,
  125. std::vector<llama_grammar_element> & out_elements,
  126. bool is_nested) {
  127. size_t last_sym_start = out_elements.size();
  128. const char * pos = src;
  129. while (*pos) {
  130. if (*pos == '"') { // literal string
  131. pos++;
  132. last_sym_start = out_elements.size();
  133. while (*pos != '"') {
  134. if (!*pos) {
  135. throw std::runtime_error("unexpected end of input");
  136. }
  137. auto char_pair = parse_char(pos);
  138. pos = char_pair.second;
  139. out_elements.push_back({LLAMA_GRETYPE_CHAR, char_pair.first});
  140. }
  141. pos = parse_space(pos + 1, is_nested);
  142. } else if (*pos == '[') { // char range(s)
  143. pos++;
  144. enum llama_gretype start_type = LLAMA_GRETYPE_CHAR;
  145. if (*pos == '^') {
  146. pos++;
  147. start_type = LLAMA_GRETYPE_CHAR_NOT;
  148. }
  149. last_sym_start = out_elements.size();
  150. while (*pos != ']') {
  151. if (!*pos) {
  152. throw std::runtime_error("unexpected end of input");
  153. }
  154. auto char_pair = parse_char(pos);
  155. pos = char_pair.second;
  156. enum llama_gretype type = last_sym_start < out_elements.size()
  157. ? LLAMA_GRETYPE_CHAR_ALT
  158. : start_type;
  159. out_elements.push_back({type, char_pair.first});
  160. if (pos[0] == '-' && pos[1] != ']') {
  161. if (!pos[1]) {
  162. throw std::runtime_error("unexpected end of input");
  163. }
  164. auto endchar_pair = parse_char(pos + 1);
  165. pos = endchar_pair.second;
  166. out_elements.push_back({LLAMA_GRETYPE_CHAR_RNG_UPPER, endchar_pair.first});
  167. }
  168. }
  169. pos = parse_space(pos + 1, is_nested);
  170. } else if (is_word_char(*pos)) { // rule reference
  171. const char * name_end = parse_name(pos);
  172. uint32_t ref_rule_id = get_symbol_id(state, pos, name_end - pos);
  173. pos = parse_space(name_end, is_nested);
  174. last_sym_start = out_elements.size();
  175. out_elements.push_back({LLAMA_GRETYPE_RULE_REF, ref_rule_id});
  176. } else if (*pos == '(') { // grouping
  177. // parse nested alternates into synthesized rule
  178. pos = parse_space(pos + 1, true);
  179. uint32_t sub_rule_id = generate_symbol_id(state, rule_name);
  180. pos = parse_alternates(state, pos, rule_name, sub_rule_id, true);
  181. last_sym_start = out_elements.size();
  182. // output reference to synthesized rule
  183. out_elements.push_back({LLAMA_GRETYPE_RULE_REF, sub_rule_id});
  184. if (*pos != ')') {
  185. throw std::runtime_error(std::string("expecting ')' at ") + pos);
  186. }
  187. pos = parse_space(pos + 1, is_nested);
  188. } else if (*pos == '*' || *pos == '+' || *pos == '?') { // repetition operator
  189. if (last_sym_start == out_elements.size()) {
  190. throw std::runtime_error(std::string("expecting preceding item to */+/? at ") + pos);
  191. }
  192. // apply transformation to previous symbol (last_sym_start to end) according to
  193. // rewrite rules:
  194. // S* --> S' ::= S S' |
  195. // S+ --> S' ::= S S' | S
  196. // S? --> S' ::= S |
  197. uint32_t sub_rule_id = generate_symbol_id(state, rule_name);
  198. std::vector<llama_grammar_element> sub_rule;
  199. // add preceding symbol to generated rule
  200. sub_rule.insert(
  201. sub_rule.end(), out_elements.begin() + last_sym_start, out_elements.end());
  202. if (*pos == '*' || *pos == '+') {
  203. // cause generated rule to recurse
  204. sub_rule.push_back({LLAMA_GRETYPE_RULE_REF, sub_rule_id});
  205. }
  206. // mark start of alternate def
  207. sub_rule.push_back({LLAMA_GRETYPE_ALT, 0});
  208. if (*pos == '+') {
  209. // add preceding symbol as alternate only for '+' (otherwise empty)
  210. sub_rule.insert(
  211. sub_rule.end(), out_elements.begin() + last_sym_start, out_elements.end());
  212. }
  213. sub_rule.push_back({LLAMA_GRETYPE_END, 0});
  214. add_rule(state, sub_rule_id, sub_rule);
  215. // in original rule, replace previous symbol with reference to generated rule
  216. out_elements.resize(last_sym_start);
  217. out_elements.push_back({LLAMA_GRETYPE_RULE_REF, sub_rule_id});
  218. pos = parse_space(pos + 1, is_nested);
  219. } else {
  220. break;
  221. }
  222. }
  223. return pos;
  224. }
  225. const char * parse_alternates(
  226. parse_state & state,
  227. const char * src,
  228. const std::string & rule_name,
  229. uint32_t rule_id,
  230. bool is_nested) {
  231. std::vector<llama_grammar_element> rule;
  232. const char * pos = parse_sequence(state, src, rule_name, rule, is_nested);
  233. while (*pos == '|') {
  234. rule.push_back({LLAMA_GRETYPE_ALT, 0});
  235. pos = parse_space(pos + 1, true);
  236. pos = parse_sequence(state, pos, rule_name, rule, is_nested);
  237. }
  238. rule.push_back({LLAMA_GRETYPE_END, 0});
  239. add_rule(state, rule_id, rule);
  240. return pos;
  241. }
  242. static const char * parse_rule(parse_state & state, const char * src) {
  243. const char * name_end = parse_name(src);
  244. const char * pos = parse_space(name_end, false);
  245. size_t name_len = name_end - src;
  246. uint32_t rule_id = get_symbol_id(state, src, name_len);
  247. const std::string name(src, name_len);
  248. if (!(pos[0] == ':' && pos[1] == ':' && pos[2] == '=')) {
  249. throw std::runtime_error(std::string("expecting ::= at ") + pos);
  250. }
  251. pos = parse_space(pos + 3, true);
  252. pos = parse_alternates(state, pos, name, rule_id, false);
  253. if (*pos == '\r') {
  254. pos += pos[1] == '\n' ? 2 : 1;
  255. } else if (*pos == '\n') {
  256. pos++;
  257. } else if (*pos) {
  258. throw std::runtime_error(std::string("expecting newline or end at ") + pos);
  259. }
  260. return parse_space(pos, true);
  261. }
  262. parse_state parse(const char * src) {
  263. try {
  264. parse_state state;
  265. const char * pos = parse_space(src, true);
  266. while (*pos) {
  267. pos = parse_rule(state, pos);
  268. }
  269. // Validate the state to ensure that all rules are defined
  270. for (const auto & rule : state.rules) {
  271. for (const auto & elem : rule) {
  272. if (elem.type == LLAMA_GRETYPE_RULE_REF) {
  273. // Ensure that the rule at that location exists
  274. if (elem.value >= state.rules.size() || state.rules[elem.value].empty()) {
  275. // Get the name of the rule that is missing
  276. for (const auto & kv : state.symbol_ids) {
  277. if (kv.second == elem.value) {
  278. throw std::runtime_error("Undefined rule identifier '" + kv.first + "'");
  279. }
  280. }
  281. }
  282. }
  283. }
  284. }
  285. return state;
  286. } catch (const std::exception & err) {
  287. fprintf(stderr, "%s: error parsing grammar: %s\n", __func__, err.what());
  288. return parse_state();
  289. }
  290. }
  291. static void print_grammar_char(FILE * file, uint32_t c) {
  292. if (0x20 <= c && c <= 0x7f) {
  293. fprintf(file, "%c", static_cast<char>(c));
  294. } else {
  295. // cop out of encoding UTF-8
  296. fprintf(file, "<U+%04X>", c);
  297. }
  298. }
  299. static bool is_char_element(llama_grammar_element elem) {
  300. switch (elem.type) {
  301. case LLAMA_GRETYPE_CHAR: return true;
  302. case LLAMA_GRETYPE_CHAR_NOT: return true;
  303. case LLAMA_GRETYPE_CHAR_ALT: return true;
  304. case LLAMA_GRETYPE_CHAR_RNG_UPPER: return true;
  305. default: return false;
  306. }
  307. }
  308. static void print_rule_binary(FILE * file, const std::vector<llama_grammar_element> & rule) {
  309. for (auto elem : rule) {
  310. switch (elem.type) {
  311. case LLAMA_GRETYPE_END: fprintf(file, "END"); break;
  312. case LLAMA_GRETYPE_ALT: fprintf(file, "ALT"); break;
  313. case LLAMA_GRETYPE_RULE_REF: fprintf(file, "RULE_REF"); break;
  314. case LLAMA_GRETYPE_CHAR: fprintf(file, "CHAR"); break;
  315. case LLAMA_GRETYPE_CHAR_NOT: fprintf(file, "CHAR_NOT"); break;
  316. case LLAMA_GRETYPE_CHAR_RNG_UPPER: fprintf(file, "CHAR_RNG_UPPER"); break;
  317. case LLAMA_GRETYPE_CHAR_ALT: fprintf(file, "CHAR_ALT"); break;
  318. }
  319. switch (elem.type) {
  320. case LLAMA_GRETYPE_END:
  321. case LLAMA_GRETYPE_ALT:
  322. case LLAMA_GRETYPE_RULE_REF:
  323. fprintf(file, "(%u) ", elem.value);
  324. break;
  325. case LLAMA_GRETYPE_CHAR:
  326. case LLAMA_GRETYPE_CHAR_NOT:
  327. case LLAMA_GRETYPE_CHAR_RNG_UPPER:
  328. case LLAMA_GRETYPE_CHAR_ALT:
  329. fprintf(file, "(\"");
  330. print_grammar_char(file, elem.value);
  331. fprintf(file, "\") ");
  332. break;
  333. }
  334. }
  335. fprintf(file, "\n");
  336. }
  337. static void print_rule(
  338. FILE * file,
  339. uint32_t rule_id,
  340. const std::vector<llama_grammar_element> & rule,
  341. const std::map<uint32_t, std::string> & symbol_id_names) {
  342. if (rule.empty() || rule.back().type != LLAMA_GRETYPE_END) {
  343. throw std::runtime_error(
  344. "malformed rule, does not end with LLAMA_GRETYPE_END: " + std::to_string(rule_id));
  345. }
  346. fprintf(file, "%s ::= ", symbol_id_names.at(rule_id).c_str());
  347. for (size_t i = 0, end = rule.size() - 1; i < end; i++) {
  348. llama_grammar_element elem = rule[i];
  349. switch (elem.type) {
  350. case LLAMA_GRETYPE_END:
  351. throw std::runtime_error(
  352. "unexpected end of rule: " + std::to_string(rule_id) + "," +
  353. std::to_string(i));
  354. case LLAMA_GRETYPE_ALT:
  355. fprintf(file, "| ");
  356. break;
  357. case LLAMA_GRETYPE_RULE_REF:
  358. fprintf(file, "%s ", symbol_id_names.at(elem.value).c_str());
  359. break;
  360. case LLAMA_GRETYPE_CHAR:
  361. fprintf(file, "[");
  362. print_grammar_char(file, elem.value);
  363. break;
  364. case LLAMA_GRETYPE_CHAR_NOT:
  365. fprintf(file, "[^");
  366. print_grammar_char(file, elem.value);
  367. break;
  368. case LLAMA_GRETYPE_CHAR_RNG_UPPER:
  369. if (i == 0 || !is_char_element(rule[i - 1])) {
  370. throw std::runtime_error(
  371. "LLAMA_GRETYPE_CHAR_RNG_UPPER without preceding char: " +
  372. std::to_string(rule_id) + "," + std::to_string(i));
  373. }
  374. fprintf(file, "-");
  375. print_grammar_char(file, elem.value);
  376. break;
  377. case LLAMA_GRETYPE_CHAR_ALT:
  378. if (i == 0 || !is_char_element(rule[i - 1])) {
  379. throw std::runtime_error(
  380. "LLAMA_GRETYPE_CHAR_ALT without preceding char: " +
  381. std::to_string(rule_id) + "," + std::to_string(i));
  382. }
  383. print_grammar_char(file, elem.value);
  384. break;
  385. }
  386. if (is_char_element(elem)) {
  387. switch (rule[i + 1].type) {
  388. case LLAMA_GRETYPE_CHAR_ALT:
  389. case LLAMA_GRETYPE_CHAR_RNG_UPPER:
  390. break;
  391. default:
  392. fprintf(file, "] ");
  393. }
  394. }
  395. }
  396. fprintf(file, "\n");
  397. }
  398. void print_grammar(FILE * file, const parse_state & state) {
  399. try {
  400. std::map<uint32_t, std::string> symbol_id_names;
  401. for (const auto & kv : state.symbol_ids) {
  402. symbol_id_names[kv.second] = kv.first;
  403. }
  404. for (size_t i = 0, end = state.rules.size(); i < end; i++) {
  405. // fprintf(file, "%zu: ", i);
  406. // print_rule_binary(file, state.rules[i]);
  407. print_rule(file, uint32_t(i), state.rules[i], symbol_id_names);
  408. // fprintf(file, "\n");
  409. }
  410. } catch (const std::exception & err) {
  411. fprintf(stderr, "\n%s: error printing grammar: %s\n", __func__, err.what());
  412. }
  413. }
  414. std::vector<const llama_grammar_element *> parse_state::c_rules() {
  415. std::vector<const llama_grammar_element *> ret;
  416. ret.reserve(rules.size());
  417. for (const auto & rule : rules) {
  418. ret.push_back(rule.data());
  419. }
  420. return ret;
  421. }
  422. }