|
I hate problems like that.
Here I need to group these by common prefix so that this:
test -> expr
expr -> ambig1 ambig2 ambig3
expr -> ambig1 ambig2 ambig4
expr -> ambig1 ambig2
expr2 -> ambig2 ambig3
expr2 -> ambig2
becomes
test -> expr
expr -> ambig1 ambig2 ambig3
expr -> ambig1 ambig2 ambig4
expr -> ambig1 ambig2
expr2 -> ambig2 ambig3
expr2 -> ambig2
Maybe it *is* easy.
This isn't really a programming question, more a complaint, but if anyone has any ideas I'll listen
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 posted that question after I posted this.
because i decided to ask it.
at first I wasn't intending to. I just wanted to vent about it. 
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 fun thing about problems like this is to figure out what makes it easy for you. We are really good at categorizing / grouping recursively without thinking, and computers have to be programmed to do this stuff.
So, why is this easy for the brain to figure out? How do you capture that ease in an algorithm?
Latest Article - A 4-Stack rPI Cluster with WiFi-Ethernet Bridging
Learning to code with python is like learning to swim with those little arm floaties. It gives you undeserved confidence and will eventually drown you. - DangerBunny
Artificial intelligence is the only remedy for natural stupidity. - CDP1802
|
|
|
|
|
ha, i just posted something similar to this "Mindfulness and coding" up top of the lounge
GMTA
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.
|
|
|
|
|
as far as how, visually I can see the groups. The common prefixes jump out at me as I scan the list, but now I'm drilling down into how my eyes are moving across the data
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 think our brain is "used to" to spot differences by identifying some features
and comparing them. This enabled me to understand "your problem"  ,
but at first I was lost …
|
|
|
|
|
it's an unusual problem for sure.
I've given up on LALR parsing for now because my tables are off - for some grammars - and i can't figure out why.
So instead what I'm doing is improving my LL(1) parser with automatic grammar refactoring so you can use grammars that are not intrinsically LL(1) - LL(1) being very limiting in terms of expressive power.
And this is part of the process. The full process is explained here at the link below, fortunately I got accustomed to understanding heavy Indian accents and Indian-English vernacular while at Microsoft. =)
Left Factoring[^]
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 can't even tell what you're trying to communicate to the reader.
|
|
|
|
|
here. Consider this as flat strings (same problem)
abbc
aaab
dbba
dc
aab
dbbc
should be split into the following groups and sorted based on common prefix
abbc
aab
aaab
dbba
dbbc
dc
however, if there are more common prefixes, they need to be further grouped so
aab
aaab
becomes it's own subgroup.
the result ultimately becomes a 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.
|
|
|
|
|
Similar to a Word Search Tree (Spell Check Tree) ?
|
|
|
|
|
anyway, I'm not looking for a solution here.
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.
|
|
|
|
|
Sure, but you still need to clearly communicate your rant.
|
|
|
|
|
meh. i already solved it so it's no longer renting space in my head.
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.
|
|
|
|
|
Do naughty programmers dress up in Loungerie?
"If we don't change direction, we'll end up where we're going"
|
|
|
|
|
That question is just pants.
|
|
|
|
|
Speaking only for myself... no.
|
|
|
|
|
... who posts those dumb questions. I was watching the film "Jason Bourne" last night (yes, I know). At the beginning was the usual scene, a darkened room with a few people controlling the world from their laptops. As their fingers were playing over the keys I heard someone say "Use SQL to corrupt their database(s)".
|
|
|
|
|
 I liked the first Bourne, I read the books and the books are very of their time.
|
|
|
|
|
Richard MacCutchan wrote: Use SQL to corrupt their database(s)
Having performed my time writing SQL, yes I can see that. The best way to do this is to have inexperienced people try to "improve" the SQL code for you... that will irreparably booger up a database faster then you can say STOP! NO DON'T!
It was broke, so I fixed it.
|
|
|
|
|
|
|
Modern apps use AutoCorrupt.
|
|
|
|
|
GenJerDan wrote: Modern apps use AutoCorrupt.
Aka Windows 10 update service. 
Latest Article - A 4-Stack rPI Cluster with WiFi-Ethernet Bridging
Learning to code with python is like learning to swim with those little arm floaties. It gives you undeserved confidence and will eventually drown you. - DangerBunny
Artificial intelligence is the only remedy for natural stupidity. - CDP1802
|
|
|
|
|
LMAO
someone probably heard "SQL injection attack" and only remembered the SQL part.
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
