knr, branch master Category-0 solutions to The C Programming Language, 2nd Edition https://git.zlg.space/knr/atom/?h=master 2022-01-24T20:57:59Z README.mdown: Add Roadmap section 2022-01-24T20:57:59Z zlg zlg@zlg.space 2022-01-24T20:57:59Z urn:sha1:d7aade6d78b8b307861875b9319a69bae1460fd6 The exercises may be completed, but that doesn't mean the work is over! I'll need to verify the correctness of the later exercises, and will someday comb over the messier solutions that I'm less satisfied with. I'd like to put together a modern set of solutions, too, to illustrate how C has improved over the years. Outside interest will determine whether this is pursued. README.mdown: Add some extra bits about the project 2022-01-24T07:26:33Z zlg zlg@zlg.space 2022-01-24T07:26:33Z urn:sha1:13a2623393c3223ff32abc9e7d5979daf7391301 Solve Exercise 8-8: bfree() 2022-01-24T07:19:22Z zlg zlg@zlg.space 2022-01-24T07:19:22Z urn:sha1:45f0db25dac2d5e69a71bd402039a698549abfdb Well, here it is. The final solution to the final exercise! These last few exercise solutions are not ideal by any measure of coding excellence, but they function. I plan to come back to this some day, with better debugging knowledge. Then I can correct any issues. Solve Exercise 8-7: malloc & free, improved 2022-01-24T05:20:25Z zlg zlg@zlg.space 2022-01-24T05:20:25Z urn:sha1:06988a01833c5f669f83b16b35f0b3f70c36f807 There wasn't much to check for, but I checked for what I could think of. Solve Exercise 8-6: calloc() 2022-01-24T01:59:56Z zlg zlg@zlg.space 2022-01-24T01:59:56Z urn:sha1:2bbb384783f667226e117e62992779498bc7e5b8 I chose to implement calloc() by calling malloc. This exercise went well, but I found it difficult to verify the contents of the headers and buffers within memory. Valgrind showed the correct number of bytes allocated, and a memory dump pointed to a good result, but research was not conclusive. Solve Exercise 8-05: fsize extended 2022-01-19T05:58:37Z zlg zlg@zlg.space 2022-01-19T05:58:37Z urn:sha1:b1805ae57e314be9d56c099a282206053043fa4b This exercise uses the standard library instead of the homegrown dirent.h outlined in the book. This is due to misbehavior in outputting the file or directory names. This pointed to a data mismatch between the data model supplied by the book and the data model actually used by my operating system (GNU/Linux). Solve Exercise 8-4: fseek() implementation 2022-01-10T04:18:52Z zlg zlg@zlg.space 2022-01-10T04:18:52Z urn:sha1:bfd18a52e1baa4da7040b8df04a3f29e83b0d6b6 Solve exercise 8-3: fflush and fclose 2022-01-10T00:46:25Z zlg zlg@zlg.space 2022-01-10T00:46:25Z urn:sha1:41d86a29051af9e3b5fe7e37bd4c0c0a18993767 Refactor syscalls.h for ch8 exercises 2022-01-10T00:41:26Z zlg zlg@zlg.space 2022-01-10T00:41:26Z urn:sha1:2b68c3d06fb2961ae3797d1ef461cff655f328b2 The refactor includes implementations for fflush and fclose as well, needed in 8-03. Solve Exercise 8-2: fopen and fillbuf 2018-12-22T09:23:35Z zlg zlg@zlg.space 2018-12-22T09:23:35Z urn:sha1:4ad4e6c7f6d2fb414d22dd3e55801c85b02c1af7 AUTHORS: update contact info 2018-08-23T03:07:12Z zlg zlg@zlg.space 2018-08-23T03:07:12Z urn:sha1:963091b93c3330bd562df204fdd1a063efebc7c6 perfeeerrrrrm 2017-05-21T05:48:50Z zlg zlg@zlg.space 2017-05-21T05:48:50Z urn:sha1:f3e194ceb2405d2063501bd46b270d988931d36b 8-1: Correct superfluous increment, comment 2017-05-20T08:21:01Z zlg zlg@zlg.space 2017-05-20T08:21:01Z urn:sha1:3a80ead1cbe94d23205a490c8bf469feb5960f95 Solve Exercise 8-1: `cat` remastered 2017-05-20T08:13:28Z zlg zlg@zlg.space 2017-05-20T08:13:28Z urn:sha1:443c8b479d7ca0bf45f691ab2da6fb8d35045d1f Solve Exercise 7-9: isupper, time, and space 2017-02-27T09:20:38Z zlg zlg@zlg.space 2017-02-27T09:20:38Z urn:sha1:fcfb2db63b01f209fb2c8fdc500023241435377f Solve Exercise 7-8: Paged file print-outs 2017-02-20T11:21:59Z zlg zlg@zlg.space 2017-02-20T11:21:59Z urn:sha1:729b54b9f6921ca9a4ee91ddb743a6fb7203658c Solve Exercise 7-7: Match pattern in files 2016-11-21T08:07:37Z zlg zlg@zlg.space 2016-11-21T08:07:37Z urn:sha1:0947afc6a1338a0408c8d6fe12cda08f87cca2bb This one was tricky, but the solution was rather simple. Remove unneeded function declaration in 7-06 2016-11-21T08:04:34Z zlg zlg@zlg.space 2016-11-21T08:04:34Z urn:sha1:55e5e56ff1eae9b6234ec885b4fc6fee907d1e75 Solve Exercise 7-6: simple `diff` utility 2016-11-17T15:34:18Z zlg zlg@zlg.space 2016-11-17T15:34:18Z urn:sha1:54b3475b3041bf35c25bfad2f521d5751e6eadbf Actually run astyle on the file... 2016-10-12T13:54:44Z zlg zlg@zlg.space 2016-10-12T13:54:44Z urn:sha1:ce7f0379df5dbfca9b86492ea5d2993196a1cc52 Solve Exercise 7-5: RPN calculator with scanf() 2016-10-12T13:49:26Z zlg zlg@zlg.space 2016-10-12T13:49:26Z urn:sha1:edf72affee48c3e6530d6f60142d834eecae8aa3 This exercise was deceptively simple, and ended up simpler than the original! The *scanf series of functions is very useful, but you also have to be careful or you'll run into segfaults. Solve Exercise 7-4: minscanf() 2016-06-30T10:56:52Z zlg zlg@zlg.space 2016-06-30T10:56:52Z urn:sha1:3aa9b1189dc7ee6660a2b7123ee9a00df0f9ca09 This one wasn't too bad, either! There's a minor bug in the code, but I'm not sure how to fix it. It *technically* meets muster, though. :P Solve Exercise 7-3: minprintf() 2016-06-26T09:57:18Z zlg zlg@zlg.space 2016-06-26T09:57:18Z urn:sha1:a8db504e7d098123075bd00d2a998488a97af81d The massive astyle sweep! 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. Solve Exercise 7-2: Format arbitrary input 2016-06-16T16:51:16Z zlg zlg@zlg.space 2016-06-16T16:51:16Z urn:sha1:82656bf5aa4edd668e1adc3faa8148251509b912 The solution is technically not 100% correct, but good luck figuring out a robust solution inside Category-0 restrictions. Unicode characters like ¬ or ♥ show up as 64-bit hex codes and I couldn't find a way to shorten them. Then again, UTF-8 supports characters up to 8 bytes long. Use it with plain ASCII and it looks only minorly off. 1-16 solution code and comment style cleanup 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. Change license to GPLv3, add contributing guide 2015-12-20T02:37:40Z zlg zlg@zlg.space 2015-12-20T02:37:40Z urn:sha1:57df72caf8d749c7cd5f36117ff35e41975db3d3 * Improve README tone * Add `astylerc` for use with the astyle package * Add AUTHORS file to acknowledge contributors Re-solve Exercise 1-16: arbitrarily long maxline 2015-12-20T01:43:20Z Isa Hassen hassen.isa@gmail.com 2015-12-19T00:40:12Z urn:sha1:032b64e37a23541e136dcf082a4564023579ed39 A completely rewritten solution which follows the spec given in the book exactly; make the program work for arbitrarily long input lines while modifying `main()` only. I've only changed the name of the macro MAXLINE to BUFFSIZE for clarity - otherwise the code is typed up exactly as found in the book. It demonstrates the use of a buffer without modifying any of the helper functions. Solve Exercise 7-1: `upper` and `lower` 2015-12-08T11:10:43Z zlg zlg@zlg.space 2015-12-08T11:10:43Z urn:sha1:ea3c92d58cdf2d4030598d1052c2eb6cf2d8cc7e Two cases, one file. This exercise was a welcome departure from the recent head-scratchers. It made me think about a solution for the pathname issue I realized would crop up, too. I'm roughly 75% done with the book! Maybe by the time I finish it, I'll have a Makefile ready for the project... Solve Exercise 6-6: A simple `#define` processor 2015-12-06T05:46:57Z zlg zlg@zlg.space 2015-12-06T05:46:57Z urn:sha1:45b8159cc39792ddc4e989b11036f026d49f33e7 This exercise is probably the most challenging "function puzzle" thus far. Modifying getword(), using various states, and the hashtable all create an example of how small building blocks can work together to make something. The implementation is very simple and nowhere near completely supporting '#define', but that's not the point. To properly support it, you'd need to build an entire preprocessor/parser, and that's far beyond the scope of both the exercise and book.