Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: luser droog Newsgroups: comp.compilers Subject: code review for latest version of Parser Combinators in C Date: Wed, 22 Jun 2022 10:20:32 -0700 (PDT) Organization: Compilers Central Lines: 25 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-06-072@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="29020"; mail-complaints-to="abuse@iecc.com" Keywords: tools, available Posted-Date: 22 Jun 2022 14:04:24 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:3093 I've got a new rewrite of my parser combinators working upto and including a regex compiler and an ebnf compiler that produce parsers. Similar to the compiler-compilers discussed recently, this is a compiler-interpreter. It doesn't produce a standalone compiler, but a function object. 2 .c files. 2 .h files. And one example/testing file. It tries to make C look like Lisp (which I hope will pique Kaz's interest (and comments)). $ make count wc pc11*[ch] 437 1879 11141 pc11object.c 101 517 3607 pc11object.h 639 2496 16281 pc11parser.c 81 322 1918 pc11parser.h 169 685 4904 pc11test.c 1427 5899 37851 total https://codereview.stackexchange.com/questions/277525/5912/parser-combinators-in-c-redux Code also available here for those that don't like the terms of StackExchange: https://github.com/luser-dr00g/pcomb/archive/af8c3354f0a615087de79d3ccb409f32ef47d480.zip