it's nice to see a larger company not being so terrible :-)
one of two videos has a download link for me. one uploaded in 2008 has a link but not the one from 2006
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…
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…
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…
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…
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...)
print [1,2,3].unique() whoops.
it's nice to see a larger company not being so terrible :-)
one of two videos has a download link for me. one uploaded in 2008 has a link but not the one from 2006
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…
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…
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…
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…
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...)
print [1,2,3].unique() whoops.