it's nice to see a larger company not being so terrible :-)
"you don't have to be mad to work here but ...." i've found smaller companies are much more tolerant & flexible with nutters (like me). there seems to be more focus on results than politics. in larger places I've…
one of two videos has a download link for me. one uploaded in 2008 has a link but not the one from 2006
prolog is an interesting take on programming and by comparison, the style in which you write code is still significantly different to approaches in other languages. sadly, most people when taught barely get past the…
Art of prolog makes an excellent first book, and the Craft complements it well with seasoned advice on elegant and efficient prolog.
As much as I agree with the title I find the contents of the article misleading. It is almost as if prolog didn't make him a better programmer, given the idea that prolog 'returns values' or uses 'method calls' is 'not…
prolog is actually impure logic language, and given the general lack of HOF i'd be reticent in labelling it functional. it's a declarative language though, and the model you have 'here is a query, what solutions exist'…
I would also like to say that the second edition is one of the finest cs-books I have.
There is an extended bibliography online for the second edition you've linked ftp://ftp.cs.vu.nl/pub/dick/PTAPG_2nd_Edition/index.html ''' The printed book contains only the about 400 literature references that are…
If you want that sort of succinctness, it is already covered in many compiler text books. This is to complement the existing literature with a broad and deep coverage of parsing in specific. There is most to parsing…
The second edition is far superior to the first in terms of coverage and depth. edit: I read a draft copy and after getting sucked into it for a weekend I grabbed the hard copy.
I would like to say: awesome! And yes most of my left recursion fetish would be covered by an operator precedence parser/left corner parser
ambiguity is useful for error recovery/error detection. also, some languages have ambiguity in their syntax (ML). I don't buy the 'optimization' argument. there is no reason we cannot have our cake and eat it -…
regular expressions (ala cs) are equiv to finite state machines. regular expressions can't count or match ()'s. ragel allows you to mix in code within the state machine, so it is actually far, far more powerful than a…
It actually sounds more like cancellation parsing than frost's approach (which iirc was more that left recursion is bounded by input length)
ragel is for writing state machines and automata in. many parsers are written as automata, but that does mean it is in the same category as parsing tools such as LR, LL, GLR, PEG or CFG based approaches.
I can't remember off hand if it dealt with nullable terms or hidden left recursion properly either. don't get me wrong: I like the earley parser :-) I just think the original paper has some omissions and the treatment…
it isn't cubic time either iirc
and while i'm here - the original earley paper is full of bugs.for a modern treatment you may find aycock & horspool's work on 'practical earley parsing' interesting, as well as the work on the Marpa Parser in perl.…
It has several bad properties too. The algorithm they outline is exponential. The challenge to make it run in cubic time will certainly turn it into a GLR or an Earley parser. (They can be formed from each other) To me:…
it is driven by pure sine waves -- you can't have polyphony or voice spectra (easily...)
coffeescript is only a syntactic change and introduces no new semantics. it will always win in terms of code generated
print [1,2,3].unique() whoops.
I had a go on this. It was awesome fun. It happened on a whim - it was noticed the tesla coils were powered by audio, and we could easily get audio output from a kinect.
It is like fizzbuzz/binary search in that most people think they can write it and they get it wrong. Quicksort requires careful selection of pivots, and is unstable. (Many scripting languages (perl, python) are opting…
it's nice to see a larger company not being so terrible :-)
"you don't have to be mad to work here but ...." i've found smaller companies are much more tolerant & flexible with nutters (like me). there seems to be more focus on results than politics. in larger places I've…
one of two videos has a download link for me. one uploaded in 2008 has a link but not the one from 2006
prolog is an interesting take on programming and by comparison, the style in which you write code is still significantly different to approaches in other languages. sadly, most people when taught barely get past the…
Art of prolog makes an excellent first book, and the Craft complements it well with seasoned advice on elegant and efficient prolog.
As much as I agree with the title I find the contents of the article misleading. It is almost as if prolog didn't make him a better programmer, given the idea that prolog 'returns values' or uses 'method calls' is 'not…
prolog is actually impure logic language, and given the general lack of HOF i'd be reticent in labelling it functional. it's a declarative language though, and the model you have 'here is a query, what solutions exist'…
I would also like to say that the second edition is one of the finest cs-books I have.
There is an extended bibliography online for the second edition you've linked ftp://ftp.cs.vu.nl/pub/dick/PTAPG_2nd_Edition/index.html ''' The printed book contains only the about 400 literature references that are…
If you want that sort of succinctness, it is already covered in many compiler text books. This is to complement the existing literature with a broad and deep coverage of parsing in specific. There is most to parsing…
The second edition is far superior to the first in terms of coverage and depth. edit: I read a draft copy and after getting sucked into it for a weekend I grabbed the hard copy.
I would like to say: awesome! And yes most of my left recursion fetish would be covered by an operator precedence parser/left corner parser
ambiguity is useful for error recovery/error detection. also, some languages have ambiguity in their syntax (ML). I don't buy the 'optimization' argument. there is no reason we cannot have our cake and eat it -…
regular expressions (ala cs) are equiv to finite state machines. regular expressions can't count or match ()'s. ragel allows you to mix in code within the state machine, so it is actually far, far more powerful than a…
It actually sounds more like cancellation parsing than frost's approach (which iirc was more that left recursion is bounded by input length)
ragel is for writing state machines and automata in. many parsers are written as automata, but that does mean it is in the same category as parsing tools such as LR, LL, GLR, PEG or CFG based approaches.
I can't remember off hand if it dealt with nullable terms or hidden left recursion properly either. don't get me wrong: I like the earley parser :-) I just think the original paper has some omissions and the treatment…
it isn't cubic time either iirc
and while i'm here - the original earley paper is full of bugs.for a modern treatment you may find aycock & horspool's work on 'practical earley parsing' interesting, as well as the work on the Marpa Parser in perl.…
It has several bad properties too. The algorithm they outline is exponential. The challenge to make it run in cubic time will certainly turn it into a GLR or an Earley parser. (They can be formed from each other) To me:…
it is driven by pure sine waves -- you can't have polyphony or voice spectra (easily...)
coffeescript is only a syntactic change and introduces no new semantics. it will always win in terms of code generated
print [1,2,3].unique() whoops.
I had a go on this. It was awesome fun. It happened on a whim - it was noticed the tesla coils were powered by audio, and we could easily get audio output from a kinect.
It is like fizzbuzz/binary search in that most people think they can write it and they get it wrong. Quicksort requires careful selection of pivots, and is unstable. (Many scripting languages (perl, python) are opting…