|
Congratulations!
What I find equally amazing is that you still retain the drive to code
Happiness will never come to those who fail to appreciate what they already have. -Anon
|
|
|
|
|
Thanks! And yes ... I still code to keep the old grey cells active.
|
|
|
|
|
congratulations!
Ours was last week.
If you can keep your head while those about you are losing theirs, perhaps you don't understand the situation.
|
|
|
|
|
Quote: Ours was last week. Congratulations to you as well!
|
|
|
|
|
Well done, you!
Approaching 33 years myself and I thought I was doing well!
- I would love to change the world, but they won’t give me the source code.
|
|
|
|
|
Hang in there. It's amazing how rapidly you go from the 30s to the 50s!
|
|
|
|
|
Twice as long as me. Congrats!
Brent
|
|
|
|
|
Thanks!
|
|
|
|
|
We are 10 years shy of that, not bad for a shotgun wedding.
We have taken up bridge to keep the grey bits active and it is more fun than coding (plus we are almost the youngest there at 65).
Never underestimate the power of human stupidity -
RAH
I'm old. I know stuff - JSOP
|
|
|
|
|
Quote: plus we are almost the youngest there at 65
You are spring chickens!
|
|
|
|
|
Congrats! Working on my 42nd year myself!
Charlie Gilley
<italic>Stuck in a dysfunctional matrix from which I must escape...
"Where liberty dwells, there is my country." B. Franklin, 1783
“They who can give up essential liberty to obtain a little temporary safety deserve neither liberty nor safety.” BF, 1759
|
|
|
|
|
Thanks!
|
|
|
|
|
NFA: Lexed in 0.713062 msec
*NFA+DFA (optimized): Lexed in 0.491195 msec
*DFA: Lexed in 0.493133 msec
NFA (raw): Lexed in 1.516519 msec
DFA (raw): Lexed in 0.147636 msec
I think this is interesting in that all but the (raw) are powered by my Pike VM, but the two Raw runs are just implemented using straight finite automata
The raw DFA is of course the fastest by far, but what's interesting about it is this is a special case of the raw NFA algorithm. However, the raw NFA algorithm is much slower than the pike vm! For the DFAs it's the opposite, because of the overhead of running a pike VM, but the pike VM does NFA very efficiently. That's a really interesting property of it.
I might be able to take advantage of that to create some kind of NFA based workflow engine powered by a pike VM
* same lexer program - the NFA+DFA optimized is pure DFA in this instance
Real programmers use butterflies
|
|
|
|
|
|
So, so true. Definitely wisdom I apply to "we have a crisis and we need you to look at this RIGHT NOW!"
|
|
|
|
|
Been trying to get the Microsoft speech synth to speak Pinyin (a "sounds like" for Chinese).
I can get it to speak English but only sometimes with Pinyin: sometimes the word comes out right, something it sounds like it's being spelled out.
Turns out the "en-US" language voices handle it, the "en-CA" voices don't. Both considered "English".
It was only in wine that he laid down no limit for himself, but he did not allow himself to be confused by it.
― Confucian Analects: Rules of Confucius about his food
|
|
|
|
|
Maybe try South African - en_ZA or "real" english "en_UK", or maybe en_NG for Nigeria?
|
|
|
|
|
That last one always sounds the same "Hello. I am a Nigerian Prince, and ..."
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
You mean Chinese with Dutch accent?
It was only in wine that he laid down no limit for himself, but he did not allow himself to be confused by it.
― Confucian Analects: Rules of Confucius about his food
|
|
|
|
|
I blame u. And u. And u too eh!
I, for one, like Roman Numerals.
|
|
|
|
|
So my little Pike VM based lexer[^] now generates ideal code. The optimization took me over a week but this is so cool.
I found out that each machine program that is not optimized has i think one ideal optimized program, and because of the way the bytecode works it's very hard (if not impossible) to make two programs match the same language.
I just can't get over how cool this endeavor was. Super satisfying.
It's a "real" compiler, with a "real" optimization phase, only for regex instead of sourcecode.
I've never made one before. It was neat. Now I'm not sure what to do next.
Real programmers use butterflies
|
|
|
|
|
honey the codewitch wrote: Now I'm not sure what to do next. well what comes after lexing?
compilation, [optimisation] code gen, [optimisation] linking [optimisation].
back to work.
after many otherwise intelligent sounding suggestions that achieved nothing the nice folks at Technet said the only solution was to low level format my hard disk then reinstall my signature. Sadly, this still didn't fix the issue!
|
|
|
|
|
that's all done.
parsing comes after lexing but I've made parsers already.
I'll probably be working with Qwertie on LLLPG here soon but I'm waiting on him for some things.
Real programmers use butterflies
|
|
|
|
|
This is where you take a glass of Whisky, snuggle down with your significant better half and watch a movie, or whatever fits your bill.
About half ways through the movie you will get annoyed why the main actor does something the wrong way and then try to create a solution for that...
|
|
|
|
|
If a developer has hand surgery, is that Tech Knuckle support?
(Sorry pkfox but I couldn't resist)
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
AntiTwitter: @DalekDave is now a follower!
|
|
|
|