Build tool
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

BXParser.cc 7.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421
  1. #include "BXParser.h"
  2. #include <stdlib.h>
  3. #include <stdio.h>
  4. #include <string.h>
  5. #include <errno.h>
  6. int BXParser::get() {
  7. int c = buf_.get();
  8. ch_ += 1;
  9. if (c == '\n') {
  10. ch_ = 1;
  11. line_ += 1;
  12. }
  13. return c;
  14. }
  15. BXParser::Operator BXParser::readOperator() {
  16. int ch2 = peek(2);
  17. if (peek() == ':' && ch2 == '=') {
  18. skip(); // ':'
  19. skip(); // '='
  20. return Operator::COLON_EQUALS;
  21. } else if (peek() == '+' && ch2 == '=') {
  22. skip(); // '+'
  23. skip(); // '='
  24. return Operator::PLUS_EQUALS;
  25. } else if (peek() == '=' && ch2 == '+') {
  26. skip(); // '='
  27. skip(); // '+'
  28. return Operator::EQUALS_PLUS;
  29. } else if (peek() == '|' && ch2 == '=') {
  30. skip(); // '|'
  31. skip(); // '='
  32. return Operator::BAR_EQUALS;
  33. }
  34. return Operator::NONE;
  35. }
  36. void BXParser::skip(char expected) {
  37. int ch = get();
  38. if (ch == EOF) {
  39. error(std::string("Expected '") + expected + "', got EOF");
  40. } else if (ch != expected) {
  41. error(std::string("Expected '") + expected + "', got '" + (char)ch + "'");
  42. }
  43. }
  44. [[noreturn]] void BXParser::error(std::string msg) {
  45. throw BXParseError(std::to_string(line_) + ":" + std::to_string(ch_) + ": " + msg);
  46. }
  47. static bool isWhitespace(int ch) {
  48. if (ch == ' ' || ch == '\t' || ch == '\r' || ch == '\n')
  49. return true;
  50. return false;
  51. }
  52. void BXParser::skipWhitespace() {
  53. if (flags_ & FLAG_ONE_LINE) {
  54. int ch;
  55. while (isWhitespace(ch = peek()) && ch != '\r' && ch != '\n')
  56. get();
  57. } else {
  58. while (isWhitespace(peek()))
  59. get();
  60. }
  61. }
  62. char BXParser::parseEscape() {
  63. skip(); // '\'
  64. int ch;
  65. switch (ch = get()) {
  66. case EOF:
  67. error("Unexpected EOF");
  68. case 'n':
  69. return '\n';
  70. case 'r':
  71. return '\r';
  72. case 't':
  73. return '\t';
  74. default:
  75. return (char)ch;
  76. }
  77. }
  78. static void appendVariableToString(
  79. const BXVariables &vars, std::string &name,
  80. std::string &value) {
  81. if (name.size() == 0)
  82. return;
  83. auto it = vars.find(name);
  84. if (it == vars.end())
  85. return;
  86. auto &vec = it->second;
  87. bool first = true;
  88. for (auto &part: vec) {
  89. if (!first) {
  90. value += ' ';
  91. }
  92. first = false;
  93. value += part;
  94. }
  95. }
  96. static void appendVariableToArray(
  97. const BXVariables &vars, const std::string &name,
  98. std::vector<std::string> &values) {
  99. if (name.size() == 0)
  100. return;
  101. auto it = vars.find(name);
  102. if (it == vars.end())
  103. return;
  104. auto &vec = it->second;
  105. for (auto &part: vec) {
  106. values.push_back(part);
  107. }
  108. }
  109. void BXParser::parseExpansion(const BXVariables &vars, std::vector<std::string> &values) {
  110. skip(); // '$'
  111. std::string str;
  112. switch (peek()) {
  113. case '{':
  114. skip();
  115. parseString(vars, str, '}');
  116. skip('}');
  117. appendVariableToArray(vars, str, values);
  118. break;
  119. default:
  120. if (!parseIdentifier(str)) {
  121. error("No identifier after $.");
  122. }
  123. appendVariableToArray(vars, str, values);
  124. break;
  125. }
  126. }
  127. void BXParser::parseQuotedExpansion(const BXVariables &vars, std::string &content) {
  128. skip(); // '$'
  129. std::string str;
  130. switch (peek()) {
  131. case '{':
  132. skip();
  133. parseString(vars, str, '}');
  134. skip('}');
  135. appendVariableToString(vars, str, content);
  136. break;
  137. default:
  138. if (!parseIdentifier(str)) {
  139. error("No identifier after $.");
  140. }
  141. appendVariableToString(vars, str, content);
  142. break;
  143. }
  144. }
  145. void BXParser::parseQuotedString(const BXVariables &vars, std::string &content) {
  146. skip(); // '"'
  147. int ch;
  148. while ((ch = peek()) != EOF) {
  149. switch (ch) {
  150. case EOF:
  151. error("Unexpected EOF");
  152. case '\\':
  153. content.push_back(parseEscape());
  154. break;
  155. case '$':
  156. parseQuotedExpansion(vars, content);
  157. break;
  158. case '"':
  159. skip();
  160. return;
  161. default:
  162. content.push_back(get());
  163. break;
  164. }
  165. }
  166. }
  167. bool BXParser::parseString(const BXVariables &vars, std::string &content, int sep) {
  168. bool success = false;
  169. int ch;
  170. while (1) {
  171. ch = peek();
  172. if ((sep > 0 && ch == sep) || isWhitespace(ch)) {
  173. return success;
  174. }
  175. switch (ch) {
  176. case EOF:
  177. return success;
  178. case '\\':
  179. content.push_back(parseEscape());
  180. success = true;
  181. break;
  182. case '$':
  183. parseQuotedExpansion(vars, content);
  184. success = true;
  185. break;
  186. case '"':
  187. parseQuotedString(vars, content);
  188. success = true;
  189. break;
  190. default:
  191. int ch2 = peek(2);
  192. if (
  193. (ch == ':' && ch2 == '=') ||
  194. (ch == '+' && ch2 == '=') ||
  195. (ch == '=' && ch2 == '+') ||
  196. (ch == '|' && ch2 == '=')) {
  197. return success;
  198. }
  199. content.push_back(get());
  200. success = true;
  201. break;
  202. }
  203. }
  204. }
  205. bool BXParser::parseIdentifier(std::string &content) {
  206. int ch = peek();
  207. if (!(
  208. (ch >= 'a' && ch <= 'z') ||
  209. (ch >= 'A' && ch <= 'Z') ||
  210. (ch == '_'))) {
  211. return false;
  212. }
  213. content += get();
  214. while (1) {
  215. ch = peek();
  216. if (!(
  217. (ch >= '0' && ch <= '9') ||
  218. (ch >= 'a' && ch <= 'z') ||
  219. (ch >= 'A' && ch <= 'Z') ||
  220. (ch == '_'))) {
  221. return true;
  222. }
  223. content += get();
  224. }
  225. }
  226. void BXParser::parse(BXVariables &vars) {
  227. std::string key, value;
  228. std::vector<std::string> values;
  229. skipWhitespace();
  230. if (!parseString(vars, key)) {
  231. return;
  232. }
  233. skipWhitespace();
  234. Operator prevOper = readOperator();
  235. if (prevOper == Operator::NONE) {
  236. error("Expected operator.");
  237. }
  238. auto doAssignment = [&] {
  239. switch (prevOper) {
  240. case Operator::COLON_EQUALS:
  241. vars[key] = std::move(values);
  242. values.clear();
  243. break;
  244. case Operator::PLUS_EQUALS:
  245. {
  246. auto &vec = vars[key];
  247. vec.reserve(vec.size() + values.size());
  248. for (size_t i = 0; i < values.size(); ++i) {
  249. vec.push_back(std::move(values[i]));
  250. }
  251. }
  252. values.clear();
  253. break;
  254. case Operator::EQUALS_PLUS:
  255. {
  256. auto &vec = vars[key];
  257. vec.reserve(vec.size() + values.size());
  258. for (size_t i = 0; i < vec.size(); ++i) {
  259. values.push_back(std::move(vec[i]));
  260. }
  261. vec = std::move(values);
  262. }
  263. values.clear();
  264. break;
  265. case Operator::BAR_EQUALS:
  266. {
  267. auto &vec = vars[key];
  268. for (size_t i = 0; i < vec.size(); ++i) {
  269. bool exists = false;
  270. for (auto &val: values) {
  271. if (val == vec[i]) {
  272. exists = true;
  273. break;
  274. }
  275. }
  276. if (!exists) {
  277. values.push_back(std::move(vec[i]));
  278. }
  279. }
  280. vec = std::move(values);
  281. }
  282. values.clear();
  283. break;
  284. case Operator::NONE:
  285. break;
  286. }
  287. };
  288. while (true) {
  289. skipWhitespace();
  290. // Parse next value
  291. if (peek() == '$') {
  292. parseExpansion(vars, values);
  293. value.clear();
  294. continue; // We can't have an assignment after an expansion
  295. } else if (!parseString(vars, value)) {
  296. break;
  297. }
  298. skipWhitespace();
  299. // If there's an operator next, the value we just read was a actually a key.
  300. // Otherwise, it was just another value.
  301. Operator op = readOperator();
  302. if (op == Operator::NONE) {
  303. values.push_back(std::move(value));
  304. value.clear();
  305. } else {
  306. if (value.size() == 0) {
  307. error("Expected string before assignment operator");
  308. }
  309. doAssignment();
  310. prevOper = op;
  311. key = std::move(value);
  312. value.clear();
  313. }
  314. }
  315. doAssignment();
  316. }
  317. void BXParser::parseList(const BXVariables &vars, std::vector<std::string> &values) {
  318. while (true) {
  319. skipWhitespace();
  320. std::string value;
  321. if (!parseString(vars, value)) {
  322. break;
  323. }
  324. values.push_back(std::move(value));
  325. }
  326. }
  327. void BXWriter::escape(const std::string &str) {
  328. buf_.put('"');
  329. for (char ch: str) {
  330. if (ch == '$' || ch == '"' || ch == '\\') {
  331. buf_.put('\\');
  332. }
  333. buf_.put(ch);
  334. }
  335. buf_.put('"');
  336. }
  337. void BXWriter::write(const BXVariables &vars) {
  338. for (const auto &pair: vars) {
  339. size_t chars = 0;
  340. buf_.put(pair.first);
  341. buf_.put(" :=");
  342. for (auto &val: pair.second) {
  343. if (chars >= 80) {
  344. buf_.put('\n');
  345. buf_.put('\t');
  346. chars = 0;
  347. } else {
  348. buf_.put(' ');
  349. }
  350. escape(val);
  351. chars += val.size();
  352. }
  353. buf_.put('\n');
  354. }
  355. }