|
We forgive you, but judging by your name we thought you travelled by rocket 
|
|
|
|
|
Once a coder, always a coder, no matter what your job description says.
BREAKING FAKE NEWS: Trump told the truth!
|
|
|
|
|
|
V. wrote: The biggest advantage is
that you don't have to do any quantifiable work anymore? 
Social Media - A platform that makes it easier for the crazies to find each other.
Everyone is born right handed. Only the strongest overcome it.
Fight for left-handed rights and hand equality.
|
|
|
|
|
ZurdoDev wrote: that you don't have to do any quantifiable work anymore?
yes, but when the slippage occurs even though you can blame the dev you have to deliver the news, and justify why they failed.
actually worst PM gig I had boss wanted me (on a late delivery) to tell the client X. Problem was it would mean lying to their faces.
I said, "no."
He said, "OK, expect your resignation letter ASAP." (I think expecting me to back down.)
2 minutes later he had my resignation.
Stupid pricks made me serve my notice. (about 2 weeks (4 weeks less leave), arrive late, long lunch, leave early (usually 5 minutes after getting back from lunch) - punctuated by ms solitair etc.) hmmm, next discussion topic
Message Signature
(Click to edit ->)
|
|
|
|
|
Wow, it requires some cojones to do such an outing on a public programming forum. 
V. wrote: I'm on bike distance from home
To jump on a recent's Dilbert[^] bandwagon : How do you manage biking without a brain ?
Oh, and congrats on the promotion/new job - I assume it was one.
|
|
|
|
|
Rage wrote: How do you manage biking without a brain ?
Hmmm, follow the lead of so many of the cyclists I see round here. So far I've managed to avoid contact, but some only by the slimmest of margins.
Software rusts. Simon Stephenson, ca 1994. So does this signature. me, 2012
|
|
|
|
|
Peter_in_2780 wrote: So far I've managed to avoid contact, but some only by the slimmest of margins.
It's only a matter of will. Once you have overcome this, the punches find their way alone.
|
|
|
|
|
Nope I was stuck in my job (no room for improvement or move) so I just left and found something else...
|
|
|
|
|
Cool, have fun at the new one then !
|
|
|
|
|
Congrats …  Are you going to use an e-bike ? at my work location (Gent) we were recently encouraged to go for e-bikes, that's why I am asking ...
Cheers,
|
|
|
|
|
nope, too close to work for that 
|
|
|
|
|
... into deep water.
So I recently produced this tutorial on building LL(1) parsers
Trying to make a parser using a variant of LL(k) w/ state machines instead of parse tables and I can't find readable documentation on LL(k) parsing at all so I've had to figure it out myself.
Forget you berkeley profs. I don't need your CS164 course. I have my grit and determination.
The state machine thing is pretty neat though. I've got it working for LL(1) and theoretically beyond. It's *building* the state machine past LL(1) that I need to figure out.
There's no documentation for doing things this way. There's no tutorial. The math is *hard*. Even if you think about it in code instead of math more readily, the code is *hard*
It's very clever though. When I finish it I'll feel like a hero 
Edit: I think I just built an LL(*) parser after shelving the above method (at least at the moment) though this version backtracks, and I don't like that much
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
modified 17-Jul-19 1:19am.
|
|
|
|
|
Now I know what LL stands for: League of Legends
|
|
|
|
|
haha, it's more complex than that. It basically means it reads the input left to right and top down (nodes first, then leaves) and forms a left-derivation tree.
There are parsers called LR parsers that read the input bottom up - leaves first and form a right derivation tree.
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
|
|
|
|
|
I'm looking forward to the next article!
(and in answer to your question on your last article: formatting tips can be found here[^]. If you need anything else just yell loudly)
cheers
Chris Maunder
|
|
|
|
|
thanks!
The LL(k) one probably won't be a tutorial as it's way too involved. or maybe it will, who knows?
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
|
|
|
|
|
I am following your work with interest, and hoping that, at some point, you will explain what you are doing in more detail.
cheers, Bill
«Where is the Life we have lost in living? Where is the wisdom we have lost in knowledge? Where is the knowledge we have lost in information?» T. S. Elliot
|
|
|
|
|
How to Make an LL(1) Parser: Lesson 1[^]
So that doesn't do it for you eh?
I don't know what to say. I pored over that. =D
Explained all the concepts, i thought.
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
modified 18-Jul-19 4:50am.
|
|
|
|
|
thanks, we mere mortals sometimes need help with interpreting the oracular.
"pored," ... not "poured"
fyi: there is an amazing CP example of a custom parser to allow run-time scripting/interaction of a complex WinForm app (spreadsheet) with its .NET internals. See 'ReoScript [^] in 'ReoGrid [^] .
cheers, Bill
«Where is the Life we have lost in living? Where is the wisdom we have lost in knowledge? Where is the knowledge we have lost in information?» T. S. Elliot
|
|
|
|
|
BillWoodruff wrote: "pored," ... not "poured"
Whoops. My fingers sometimes get ahead of my brain.
BillWoodruff wrote: fyi: there is an amazing CP example of a custom parser to allow run-time scripting/interaction of a complex WinForm app (spreadsheet) with its .NET internals. See 'ReoScript [^] in 'ReoGrid [^] .
That's pretty ambitious. I'll check it out.
BillWoodruff wrote: we mere mortals sometimes need help with interpreting the oracular
The parser generator code itself is not so complicated. The concepts behind it are. Without knowing them, the code looks like gibberish. Once you understand them, the code becomes obvious.
It's backward from how we devs usually like to hack.
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
|
|
|
|
|
fyi: ReoScript uses ANTLR. It's on GitHub at: [^]
cheers, Bill
«Where is the Life we have lost in living? Where is the wisdom we have lost in knowledge? Where is the knowledge we have lost in information?» T. S. Elliot
|
|
|
|
|
ah, well ANTLR is pretty well covered territory for me. In fact I started experimenting with a similar technology that ANTLR uses for its "parse tables" (actually state machines) in my projects though I may not go with it as I think I found a better way to do LL(k)
In the end, I'm making a universal LL generator. LL parsing is the easiest to use, but currently the hardest to design grammars for because LL(1) is limited, and LL(k) is complicated and traditionally memory intensive, while LL(*) is expensive.
ANTLR4 uses a variant of LL(k) called LL regular (I think?)
I'm making my own "strong" LL(k) using a technique that i think is somewhat similar to this one: The PREDICT-k Function[^]
So basically I'm making my own ANTLR but eventually I intend to extend it to LL(*) - which I've already implemented part of, and I need to finish my LL(k) parser.
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
|
|
|
|
|
The fact I don't understand what you are saying, doesn't stop me from wishing you well in whatever journey you are on 
«Where is the Life we have lost in living? Where is the wisdom we have lost in knowledge? Where is the knowledge we have lost in information?» T. S. Elliot
|
|
|
|
|
sorry. they're names for algorithms. different ways to generate the tables to parse using top down parsing similar to recursive descent parsing like you'd do if you were writing your own parser.
LL is a family of parsing algorithms.
LL(1) is very simple.
LL(k) is not.
But they both operate using the same basic overarching concepts at their core. Their tables even look somewhat the same. Very much the same once you understand the differences, if that makes sense.
When I was growin' up, I was the smartest kid I knew. Maybe that was just because I didn't know that many kids. All I know is now I feel the opposite.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
