smimou changed the topic of #ocaml to: Dicussions about the OCaml programming language | http://caml.inria.fr/
fik has joined #ocaml
<fik>
#forth
smimou has quit ["bli"]
_fab has quit []
pango_ has joined #ocaml
malc_ has quit ["leaving"]
klapmuet1 has joined #ocaml
pango has quit [Remote closed the connection]
fik has quit ["shut"]
klapmuetz has quit [Read error: 110 (Connection timed out)]
bmiller has quit [" "]
beschmi has joined #ocaml
sponge45 has joined #ocaml
bluestorm has quit ["Konversation terminated!"]
llama32 has joined #ocaml
llama32 has left #ocaml []
ziggurat has quit ["Leaving"]
ZeeGeek has joined #ocaml
batdog|gone is now known as batdog
<ZeeGeek>
I got the error that I'm putting too many arguments to the function even though I didn't. what might cause the error?
<beschmi>
ZeeGeek: most of the time, it's missing parentheses. eg f 1 + 2 instead of f (1+2)
<ZeeGeek>
the function takes three arguments and I'm giving them like f(a, b, c)
batdog is now known as batdog|gone
<ZeeGeek>
when I remove the third argument, it reported that I have to provide three arguments instead of two which was correct
<ZeeGeek>
but when I add the third one back, it complained about too many arguments again
<beschmi>
i can take a look if you paste the code + error message somewhere
<ZeeGeek>
okay
dark_light has joined #ocaml
danly has joined #ocaml
sponge45 changed the topic of #ocaml to: Discussions about the OCaml programming language | http://caml.inria.fr/
ZeeGeek has quit ["leaving"]
danly has quit [Remote closed the connection]
danly has joined #ocaml
danly has quit [Read error: 54 (Connection reset by peer)]
danly has joined #ocaml
danly has quit [Client Quit]
danly has joined #ocaml
sponge45 has quit ["zzzzzzzzzz"]
jordan- has joined #ocaml
<jordan->
can I ask a question about grammars? I am trying to write a parser
<jordan->
(in ocaml)
<Smerdyakov>
Never ask to ask. Ask the question, keep it short enough, and someone will let you know if it's inappropriate.
<jordan->
fair enough. i am curious whether you guys think the following grammar will work for an ll(1) parser, for regular expressions: R -> S|R | S, S -> (S) | TS | a | T*, T -> T* | V, V -> c | \Epsilon | R where c stands for any character
<jordan->
i tried hard to make it non redundant and unambiguous, and i plan to implement it next
<jordan->
but i am trying to figure out if it's correct
<Smerdyakov>
Ugh. Who wants to work with LL(1) grammars, anyway?
<jordan->
they're easier to implement
<jordan->
(commas separate those productions btw)
<Smerdyakov>
You don't like using parser generators?
<jordan->
no it's too complex for this
<jordan->
plus im trying to learn this stuff, i just want to know if i got the grammar right
<Smerdyakov>
I find your notation too hard to read.