From 7115aadae8d0cbae1a7282bd6e8be24ee744002c Mon Sep 17 00:00:00 2001 From: EuAndreh Date: Tue, 9 Feb 2021 19:15:44 -0300 Subject: Update link to ParsecC --- ...able-persistent-trees-and-parser-combinators-building-a-database.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) (limited to '_articles') diff --git a/_articles/2020-11-12-durable-persistent-trees-and-parser-combinators-building-a-database.md b/_articles/2020-11-12-durable-persistent-trees-and-parser-combinators-building-a-database.md index 8825c7f..abfa643 100644 --- a/_articles/2020-11-12-durable-persistent-trees-and-parser-combinators-building-a-database.md +++ b/_articles/2020-11-12-durable-persistent-trees-and-parser-combinators-building-a-database.md @@ -208,7 +208,7 @@ a header file, as I haven't written any C code in many years. So as I was writing [libedn][libedn-repo], I didn't know how to build a good C API to expose. So I tried porting the code to C, and right now I'm working on building a *good* C API for a JSON parser using parser combinators: -[ParsecC][parsecc-repo]. +~~ParsecC~~ *EDIT*: now archived, the experimentation was fun. After "finishing" ParsecC I'll have a good notion of what a good C API is, and I'll have a better direction towards how to expose code from libedn to other @@ -222,7 +222,6 @@ and property-based testing for libedn. [rust-ffi]: https://blog.eqrion.net/future-directions-for-cbindgen/ [x-bindgen-repo]: https://git.euandreh.xyz/x-bindgen/ [libedn-repo]: https://git.euandreh.xyz/libedn/ -[parsecc-repo]: https://git.euandreh.xyz/parsecc/ ## Conclusion -- cgit v1.2.3