Category-0 solutions to The C Programming Language, 2nd Edition https://git.zlg.space/knr/atom/ch5?h=master 2016-06-16T17:15:33Z 2016-06-16T17:15:33Z zlg zlg@zlg.space 2016-06-16T17:15:33Z urn:sha1:f8d9ff23eb8d3e3286ff5cf4d5f9493532991bb7 Code style should be consistent now. All future commits will be run through astyle or they will be amended. 2015-12-20T02:40:02Z zlg zlg@zlg.space 2015-12-20T02:40:02Z urn:sha1:0c7a59180de778a4e9019176a65eb02b5493b6f7 Also of note is the length that the program reports includes the newline character at the end. This has been clarified in a comment. The exercise text does not specify whether to include newlines as part of the length, so it was left alone. Removed the contributor notice, since contributor acknowledgements are centralized. 2015-02-21T06:35:43Z zlg zlg@zlg.space 2015-02-21T06:35:43Z urn:sha1:e859c083a97edf6be14b17c652835f1e27b75210 This marks the end of chapter 5. Admittedly, the solution for 5-20 is terrible, but it does what it's supposed to do. I'm just excited to move onto chapter 6 and start learning structures! 2015-02-21T05:35:39Z zlg zlg@zlg.space 2015-02-21T05:35:39Z urn:sha1:af502c08e870ea3374d9c3d20d0e195aa3658f22 2015-01-30T08:55:59Z zlg zlg@zlg.space 2015-01-30T08:55:59Z urn:sha1:1f92ea2a90d98ef150a8546cf5695a73ba68312d This exercise was a real pain in the ass. The original use of getch() and ungetch() was inferior to a line-based approach. It really doesn't seem like the way a parser should be built, but it taught me a little about the order of recursion. I'm convinced that a debugger is necessary if you want to build a good parser. This implementation doesn't recurse in a natural way, or even enough to stack data type prefixes. Hopefully by the time I get to 5-20 I'll have enough ideas to implement something that *does* recurse well. 2014-06-15T05:24:38Z zlg zlg@zlg.space 2014-06-15T05:24:38Z urn:sha1:893e4a375873f4b98d8691ffafbba8a2ccb1b55d 2014-05-21T10:54:51Z zlg zlg@zlg.space 2014-05-21T10:54:51Z urn:sha1:cb197e459c381591f9cb0a92a0cbd720bdbda5a7 2014-05-20T11:36:21Z zlg zlg@zlg.space 2014-05-20T11:36:21Z urn:sha1:209fffb91f965f4fa20ad2986218fd8557e01391 2014-04-08T10:08:32Z zlg zlg@zlg.space 2014-04-08T10:08:32Z urn:sha1:81f406956731e70f190e79ec85cfc38f504240ea 2014-04-08T09:51:09Z zlg zlg@zlg.space 2014-04-08T09:51:09Z urn:sha1:76f1afed408bb0dc25f95f5979b731ee236e18cf 2014-03-20T19:57:51Z zlg zlg@zlg.space 2014-03-20T19:57:51Z urn:sha1:2d67fcd7aefe4e78716003e9dfd8220103a5b132 2013-10-18T07:14:57Z zlg zlg@zlg.space 2013-10-18T07:14:57Z urn:sha1:eb44b112e7ac2ffbd7d48d47f26c5e210fed677c This exercise was somewhat irritating until I caved and used the code in section 5.6 like the exercise suggested. The solution is not what I think is clean, but given that [mc]*alloc haven't been covered yet, it's probably the best one can muster. Once I used the code in §5.6, the program fell into place. Still, it was a neat exercise. 2013-10-13T08:24:07Z zlg zlg@zlg.space 2013-10-13T08:24:07Z urn:sha1:8d64674314e55a1c2fa044cf9552886a4e852ec9 2013-09-26T12:17:51Z zlg zlg@zlg.space 2013-09-26T12:17:51Z urn:sha1:22ddf92e89b19c30ff77b368cab60cc95315db35 This one was pretty rough. At first I wanted to include a bunch of error-catching and "smart" stuff. When I took a second look at it and realized `itoa` returns 0 on a string, things became a bit easier. I may have been able to outsource a few things to a function or two, but overall I think it worked out. 2013-09-24T13:36:25Z zlg zlg@zlg.space 2013-09-24T13:36:25Z urn:sha1:6acde01f13a875193c8a17f100683c7cf4f804a1 2013-09-24T13:33:37Z zlg zlg@zlg.space 2013-09-24T13:33:37Z urn:sha1:b4d63aa4acb84c9bb71f6b4cd62de0560a0b3f84 2013-09-21T09:39:09Z zlg zlg@zlg.space 2013-09-21T09:39:09Z urn:sha1:cbfac3701fa8b7a1e3233f9fa437d6e3347710c7 This exercise was fun and taught me a bit about initializing arrays and working with pointers. 2013-09-15T15:17:40Z zlg zlg@zlg.space 2013-09-15T15:17:40Z urn:sha1:ce588670229cc68cebe4d93b19e9bc2c6f3c65cd 2013-09-11T11:49:22Z zlg zlg@zlg.space 2013-09-11T11:49:22Z urn:sha1:0c2e23ea497d5e83cd1b518cd597628ba35f46d8 2013-09-08T08:07:54Z zlg zlg@zlg.space 2013-09-08T08:07:54Z urn:sha1:5d5ee724cedf6124a84c0425be4f6bca0c082092 This exercise was not very fun or interesting. While I somewhat enjoyed learning to use pointers, this was a bunch of busywork. It felt like homework, and that's terrible. It's the first exercise I've outright disliked. If you're writing a programming book, *don't* make exercises like this one! 2013-09-03T09:33:09Z zlg zlg@zlg.space 2013-09-03T09:33:09Z urn:sha1:ca6b2c0ef3d3245b528303ce8d871520acaf68eb This exercise seemed like it was designed to "pull it all together" with things learned in the previous few pages. Not much new in terms of techniques, but more a test to see how you could blend everything together. 2013-09-02T12:11:07Z zlg zlg@zlg.space 2013-09-02T12:11:07Z urn:sha1:5d4b543ae9fbdaf7b86cbbd2b652808ce282c91f Detailed answers below the question will only occur now if I cannot explain myself well enough in code and nearby comments. I'm looking to learn how to write better comments so there's less need for prose. 2013-08-29T11:29:09Z zlg zlg@zlg.space 2013-08-29T11:29:09Z urn:sha1:6484527cec80136b09288abb1583046f5b776411 2013-08-19T07:35:49Z zlg zlg@zlg.space 2013-08-19T07:35:49Z urn:sha1:8bb191cb2808968db87ce39d45f40c1996690553 2013-08-13T09:37:02Z zlg zlg@zlg.space 2013-08-13T09:37:02Z urn:sha1:fcbbe1a17fcb9fa129b737ddb8d72683ec9bfc3b