Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.lang.forth    |    Forth programmers eat a lot of Bratwurst    |    117,927 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 117,384 of 117,927    |
|    Hans Bezemer to Anton Ertl    |
|    Re: Parsing timestamps?    |
|    02 Jul 25 19:52:50    |
      From: the.beez.speaks@gmail.com              On 02-07-2025 17:22, Anton Ertl wrote:              >> And that's not the solution - it's the PROBLEM. You can add loads of       >> complexity without much (immediate) penalty. You're not compelled to       >> study - or even *think* about your algorithm. You most probably will end       >> up with code that works - without you understanding why.       >>       >> And that will either bite you later, or limit your capability to expend       >> on that code.       >       > Yes, you can expend a lot of effort on code that's hard to write and       > hard to understand, but that's not limited to Forth.       >       > If you mean that, by making code hard to write, Forth without locals       > makes it easier to extend the code, I very much doubt it. In some       > cases it may not be harder, but in others (where the extension       > requires, e.g., dealing with additional data in existing colon       > definitions) it is harder.              No, I mean the inverse - if you can add all kinds of complexity without       penalty (like C) *that's* the point where you create unmaintainable       code. But it *still* works.              You can't get away with such code in Forth - since it will be       unmaintainable long before that point. AKA - it *won't* work. Not even       remotely.              Hans Bezemer              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca