To ensure wide penetration of this significant update, Microsoft will be
issuing updated Windows CDs to all licensed customers, free of charge.
The new CDs can be identified by the distinctive holographic Haskell
Inside logo, featuring a holographic version of this[1] portrait
Oren Ben-Kiki [EMAIL PROTECTED] wrote:
I just created an initial version of a streaming parser. This parser
is intended to serve as a reference parser for the YAML spec.
An observation about your state setter functions, e.g.
setDecision :: String - State - State
setDecision decision state
As you have built ghc6.6 from sources I think that you also need to build
all haskell libs from sources. So, do
I did this, and got the feeling this would probably work, but is a
real sad world of dependency chasing with no (clear) end in sight.
So I investigated your second suggestion
On Mon, 2007-04-02 at 13:54 +0100, Malcolm Wallace wrote:
An observation about your state setter functions, ...
You can shorten your code considerably by using the standard named-field
update syntax for exactly this task:
setDecision :: String - State - State
setDecision decision state =
Hello.
I am a Computer Science student attempting to write an emulator using
Haskell.
One of my main design choices is how to deal with machine code.
Clearly it is possible to represent 0's and 1's as ASCII characters,
however it strikes me that it would be much nicer to the I/O using raw
Well, I guess I spoke to soon. After building ghc6 from feisty as
described above, I tried building missingh and have basically what I
started with.
Is there something I can tweak to get the above straightened out using
those nice deb packages, or do I have to do all the dependency chasing
On Mon, Apr 02, 2007 at 03:26:05PM +0100, Daniel Brownridge wrote:
Hello.
I am a Computer Science student attempting to write an emulator using
Haskell.
One of my main design choices is how to deal with machine code.
Clearly it is possible to represent 0's and 1's as ASCII characters,
On 02/04/2007, at 16:26, Daniel Brownridge wrote:
Hello.
I am a Computer Science student attempting to write an emulator
using Haskell.
One of my main design choices is how to deal with machine code.
Clearly it is possible to represent 0's and 1's as ASCII
characters, however it strikes
Hello Daniel,
Monday, April 2, 2007, 6:26:05 PM, you wrote:
however it strikes me that it would be much nicer to the I/O using raw
binary. I don't seem to be able to find much documentation on this.
it's our secret weapon ;)
http://haskell.org/haskellwiki/Library/Streams
[Haskell-cafe] String to Word64 Conversion
Ian Sefferman iseff at iseff.com
Sun Apr 1 15:42:07 EDT 2007
Previous message: [Haskell-cafe] Josephus problem and style
Next message: [Haskell-cafe] Data.ByteStream.Char8.words performance
Messages sorted by: [ date ] [ thread ] [ subject ] [
Jacques Carette wrote:
perhaps i was mistaken in thinking that there is a group of
math-interested
haskellers out there discussing, developing, and documenting the area? or
perhaps that group needs introductory tutorials presenting its work?
My guess is that there are a number of people
Folks,
Are there any examples of keeping a symbol table with Parsec?
I'm translating a parser from OCaml and I do this
OUTPUT COLON ID LP NUMERIC_SIMPLE RP
{ add $3 TypNumOut; SimpleOutputDec ($3, Number) }
Meaning that if a keyword Output is followed by : and an identifier
and then
Section 2.12 of the Parsec manual[1] discusses user state. It sounds
like that is what you are after.
Hope that helps,
Nick
[1] - http://www.cs.uu.nl/~daan/download/parsec/parsec.pdf
On 4/2/07, Joel Reymont [EMAIL PROTECTED] wrote:
Folks,
Are there any examples of keeping a symbol table with
On Apr 2, 2007, at 11:17 PM, Nicolas Frisby wrote:
Section 2.12 of the Parsec manual[1] discusses user state. It sounds
like that is what you are after.
Yes, thanks. My question is mostly about how to return a different
token when the lexer finds an identifier that's already in the
I too was put off by the Num issues though--strange mixture of sophisticated
category theory and lack of a sensible hierarchy of algebraic objects.
Perhaps we should replace CT with lattice theoretic thinking (e.g. functor =
monotonic
function) before cleaning up the type-related mess?
See:
Joel Reymont wrote:
Meaning that if a keyword Output is followed by : and an identifier
and then (NumericSimple) then add identifier to the symbol table as a
Number and box it in a constructor.
Then in my lexer I do a lookup to check if I have seen this identifier
and if I have seen one of
Wouldn't this be a good discussion for the Haskell Prime List?
Reilly Hayes
+1 415 388 3903 (office)
+1 415 846 1827 (mobile)
[EMAIL PROTECTED]
On Apr 2, 2007, at 3:24 PM, Andrzej Jaworski wrote:
I too was put off by the Num issues though--strange mixture of
sophisticated
category theory
17 matches
Mail list logo
