Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2015-11-07 | Solve Exercise 6-4: Highest Word Frequency | zlg | 1 | -0/+177 | |
This exercise was good practice to get back into the mindset of programming. It's not a pretty solution, but it works. I may end up coming back to this solution, because I feel like I've missed something that would make this exercise simpler. | |||||
2015-08-04 | Solve Exercise 6-03: Word cross-referencing | zlg | 1 | -0/+190 | |
2015-03-08 | Solve Exercise 6-02: Common prefix printing | zlg | 1 | -0/+239 | |
2015-03-03 | Solve Exercise 6-01: Enhanced `getword` | zlg | 1 | -0/+170 | |
This exercise improved my understanding of identifying comments and quotes by focusing on edge cases. | |||||
2015-02-20 | Solve Exercise 5-20: Expanded `dcl` | zlg | 1 | -0/+215 | |
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-20 | Solve Exercise 5-19: Omit extra parens in `undcl` | zlg | 1 | -0/+113 | |
2015-01-30 | Solve Exercise 5-18: error-recovering `dcl` | zlg | 1 | -0/+172 | |
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-08-03 | Ensure 1-02's solution compiles | zlg | 1 | -1/+4 | |
I'm preparing for build automation, so everything needs to build | |||||
2014-06-15 | Solve Exercise 5-17: field sorting | zlg | 2 | -1/+268 | |
2014-05-21 | Refactor flag handling | zlg | 3 | -24/+51 | |
2014-05-20 | Solve Exercise 5-16: directory-ordered `tail` | zlg | 1 | -0/+191 | |
2014-04-08 | Remove line_tolower() | zlg | 1 | -9/+0 | |
2014-04-08 | Solve Exercise 5-15: Case-insensitive sort | zlg | 2 | -1/+179 | |
2014-03-20 | Solve Exercise 5-14: reverse sort | zlg | 1 | -0/+152 | |
2013-10-18 | Solve Exercise 5-13: tail | zlg | 1 | -0/+106 | |
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-13 | Solve Exercise 5-12: flexible `detab` and `entab` | zlg | 2 | -0/+157 | |
2013-09-26 | Solve Exercise 5-11: `entab` and `detab` remixed! | zlg | 2 | -0/+137 | |
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-24 | Clean up 5-10's printf() calls | zlg | 1 | -4/+0 | |
2013-09-24 | Solve Exercise 5-10: expr | zlg | 1 | -0/+107 | |
2013-09-21 | Solve Exercise 5-9: day of year functions with pointers | zlg | 1 | -0/+74 | |
This exercise was fun and taught me a bit about initializing arrays and working with pointers. | |||||
2013-09-15 | Solve Exercise 5-8: Checking for errors | zlg | 1 | -0/+83 | |
2013-09-11 | Solve Exercise 5-7: Improved readlines() | zlg | 1 | -0/+106 | |
2013-09-08 | Solve Exercise 5-6: pointer-based functions | zlg | 1 | -0/+154 | |
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-03 | Solve Exercise 5-5: strn{cpy|cat|cmp} | zlg | 1 | -0/+76 | |
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-02 | Solve Exercise 5-4: strend() | zlg | 1 | -0/+37 | |
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-29 | Solve Exercise 5-3: pointer-powered strcat() | zlg | 1 | -0/+42 | |
2013-08-19 | Solve Exercise 5-2: getfloat() | zlg | 1 | -0/+75 | |
2013-08-13 | Solve Exercise 5-1: fixed getint() | zlg | 2 | -13/+82 | |
2013-08-08 | Solve Exercise 4-14: Swap Macro | zlg | 1 | -0/+30 | |
Thanks to ##c on Freenode for helping me understand what the text didn't clarify. | |||||
2013-07-23 | Correct Exercise 1-22's solution | zlg | 1 | -51/+64 | |
Tabs are now handled properly and the instructions are better followed. | |||||
2013-07-22 | Solve Exercise 4-13: Recursive reverse() | zlg | 1 | -0/+48 | |
2013-07-15 | Solve Exercise 4-12: Recursive itoa() | zlg | 1 | -0/+72 | |
2013-07-03 | Solve Exercise 4-11: getop() without ungetch() | zlg | 1 | -0/+263 | |
2013-06-27 | Solve Exercise 4-10: getline()-based calculator | zlg | 1 | -0/+276 | |
2013-06-26 | Solve Exercise 4-9: Pushed EOF and [un]getch() | zlg | 1 | -0/+284 | |
2013-06-24 | Solve Exercise 4-8: Single character buffer | zlg | 1 | -0/+281 | |
2013-06-22 | Solve Exercise 4-7: ungets() | zlg | 2 | -2/+278 | |
2013-06-21 | Solve Exercise 4-6: Variable support | zlg | 1 | -0/+272 | |
2013-06-19 | Solve Exercise 4-5: adding sin(), exp(), pow() | zlg | 1 | -0/+216 | |
2013-06-19 | Solve Exercise 4-4: Basic stack manipulation | zlg | 1 | -0/+201 | |
2013-06-18 | Solve Exercise 4-3: Add modulus to RPN calculator | zlg | 1 | -0/+147 | |
2013-05-08 | Solve Exercise 4-2: atof() enhanced | zlg | 1 | -0/+81 | |
2013-05-05 | Solve Exercise 4-1: strrindex() | zlg | 1 | -0/+87 | |
2013-04-23 | Add exercise descriptions and answers for ch1 | zlg | 13 | -51/+158 | |
* Corrected behavior in solutions for 1-9 and 1-23 | |||||
2013-04-23 | Solve Exercise 3-6: itoa (3 arg version) | zlg | 1 | -0/+67 | |
2013-04-20 | Solve Exercise 3-5: itob | zlg | 1 | -0/+85 | |
2013-04-19 | Solve Exercise 3-4: itoa improved | zlg | 1 | -0/+71 | |
2013-04-18 | Solve Exercise 3-3: expand() | zlg | 1 | -0/+82 | |
2013-04-16 | Solve Exercise 3-2: escape/unescape | zlg | 1 | -0/+68 | |
2013-04-16 | Solve Exercise 3-1: binsearch2 | zlg | 2 | -1/+72 | |