|
Or it could be Welsh:
Llanfairpwllgwyngyllgogerychwyrndrobwllllantysiliogogogoch
...of course, almost anything that came out would sound like Welsh, I'm sure... 
Anything that is unrelated to elephants is irrelephant
Anonymous
-
The problem with quotes on the internet is that you can never tell if they're genuine
Winston Churchill, 1944
-
Never argue with a fool. Onlookers may not be able to tell the difference.
Mark Twain
|
|
|
|
|
There aren't that many Ls in a Scrabble set. 
Freedom is the freedom to say that two plus two make four. If that is granted, all else follows.
-- 6079 Smith W.
|
|
|
|
|
Have you seen a Welsh scrabble set? So many Ls, they are worth 0. 
Software rusts. Simon Stephenson, ca 1994. So does this signature. me, 2012
|
|
|
|
|
Expect a big vowel movement 
|
|
|
|
|
Anything that is unrelated to elephants is irrelephant
Anonymous
-
The problem with quotes on the internet is that you can never tell if they're genuine
Winston Churchill, 1944
-
Never argue with a fool. Onlookers may not be able to tell the difference.
Mark Twain
|
|
|
|
|
Spell out a romantic poem and she's yours! (and if she isn't impressed by that she's clearly not the one for you)
|
|
|
|
|
Johnny J. wrote: spell disaster
...with the letters in that particular order? Now that would be impressive.
|
|
|
|
|
And for my next trick, I'll need a volunteer from the audience...
Anything that is unrelated to elephants is irrelephant
Anonymous
-
The problem with quotes on the internet is that you can never tell if they're genuine
Winston Churchill, 1944
-
Never argue with a fool. Onlookers may not be able to tell the difference.
Mark Twain
|
|
|
|
|
|
but now I've amassed an arsenal of them to do most everything I'd want to do.
One thing I liked about working in the field was I'd never run out of stuff to dev on.
Other people would have needs, and I'd find some way to automate those needs as much as possible.
It kept me busy, but now because of the above, my needs are met. I can generate lexers, parsers, state machines, i have components for implementing build tools, services, and basic console apps, for doing IO for advanced collections/dictionaries, whatever.
It's crazy. I'm running out of stuff I could use.
Real programmers use butterflies
|
|
|
|
|
honey the codewitch wrote: It kept me busy, but now because of the above,
Restless minds are never idle for long; pretty sure you can find something 
..and if there was a Resharper-like UI to convert a regular RegEx in VS to a compiled one, more people would be using it. You already used VS-extensions, so shouldn't keep you busy for long 
Bastard Programmer from Hell 
If you can't read my code, try converting it here[^]
"If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.
|
|
|
|
|
I used to have just such a tool as part of my Grimoire collection
The trouble with that is my regex engine cannot compete with microsoft's for matching performance and flexibility.
it is only superior for lexing.
So i don't want to encourage people to use my compiled regexes outside of a lexer.
Real programmers use butterflies
|
|
|
|
|
honey the codewitch wrote: I used to have just such a tool as part of my Grimoire collection
So, there's a lot of stuff you're keeping behind that we don't know of?
honey the codewitch wrote: The trouble with that is my regex engine cannot compete with microsoft's for matching performance and flexibility.
Linux can't compete with Windows, but still I'm running Kubuntu on one of my machines. And Raspbian 
It's not just about performance; it's also about predictability and the amount of dependencies. If performance was all that counted, we wouldn't be writing in a managed language 
Bastard Programmer from Hell
If you can't read my code, try converting it here[^]
"If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.
|
|
|
|
|
Well in terms of dependencies, MS has me beat too, since their regex ships with all versions of .NET out of the box.
And it's better tested, ergo more predictable
There's only two things it can't do, streaming and lexing.
I've built lexer generators and even describe how to use one as a matcher in one of my articles.
So there is codegen for it if you really want it.
But it comes in the form of a lexer, which is appropriate given the nature and limitations of the library, IMO
Real programmers use butterflies
|
|
|
|
|
Oh and yeah, I held back a bunch of code. I typically do that, and then feed CP a little at a time.
The reason being is I'm lazy and don't like writing tests, so I dogfood my code for two reasons:
1. Determining fitness for a general purpose.
2. Finding bugs.
I do this with most of my code before i release it here.
Real programmers use butterflies
|
|
|
|
|
Good to hear there's more articles coming
Bastard Programmer from Hell
If you can't read my code, try converting it here[^]
"If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.
|
|
|
|
|
Somebody has to in this world.
|
|
|
|
|
I suggest you get to work on this next.
|
|
|
|
|
I realize it may be a hardware need, but how about an ambidextrous smoke shifter?
|
|
|
|
|
I just thought of something really cool though I don't know much about workflow engines yet.
A pike VM based workflow engine that is - get this - TRANSACTIONAL
because this works as a series of instructions that then invoke actions, I can store up the list of actions to invoke, in priority order, and execute them only if we got to an accept state!
So basically like this:
Create or load your workflow. (builds an NFA state machine and then compiles it to bytecode)
Run your workflow by feeding the machine a series of activities. (runs the pike VM)
From there the activities trace paths through the machine. Whenever they land on certain points in the path they queue certain actions. At any time if they pass through an accept point, all the queued actions are executed. That way you can create start and end points for transactions.
I still haven't sussed this all out but what a cool idea. I think?
and a nice side benefit (plus what gave me the idea in the first place) is Pike VMs can execute NFAs faster than doing the traditional NFA traversal method.
Real programmers use butterflies
|
|
|
|
|
I wonder if decision tables might be useful as a source of ideas: [^]. I use the "airfare calculation" scenario on that page in teaching programming.
If you think of "time" as a "third dimension" to a series of decision tables ... workflow ?
«One day it will have to be officially admitted that what we have christened reality is an even greater illusion than the world of dreams.» Salvador Dali
|
|
|
|
|
I remember us talking about this. I think they can be translated directly to state machines.
I'm still working on the details. I need to study workflow systems more.
Real programmers use butterflies
|
|
|
|
|
Today we've been married for 53 years. Yes, we had our ups and downs but never for a moment have I regretted our choice in each other. ![Jig | [Dance]](https://codeproject.global.ssl.fastly.net/script/Forums/Images/jig.gif) ![Beer | [beer]](https://codeproject.global.ssl.fastly.net/script/Forums/Images/beer.gif)
modified 4-Feb-20 19:34pm.
|
|
|
|
|
Oh my gosh, wow. Congratulations.
Real programmers use butterflies
|
|
|
|
|
Thanks!
modified 4-Feb-20 18:35pm.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
