1,113 reputation
513
bio website http://-
location Eindhoven, The Netherlands
age 23
visits member for 3 years, 5 months
seen Jan 15 at 19:57

I'm a Design Engineer at ASML, Veldhoven. I'm a graduee of the university of Technology in Eindhoven, The Netherlands.

I have a publication! http://arxiv.org/abs/1306.4919 - ESA2013, co-won best paper award.


Apr
12
awarded  Good Answer
Nov
13
awarded  Yearling
Oct
11
answered Algorithm to Find the Aggregate Mass of “Granola Bar”-Like Structures?
Feb
19
awarded  Caucus
Feb
10
answered How to extract operators from the grammar productions for conflict resolution in LALR parser?
Feb
2
comment How to extract operators from the grammar productions for conflict resolution in LALR parser?
In that case, this is how Bison handles it: gnu.org/software/bison/manual/html_node/…. Specifically, the last token (so terminal, not nonterminal) of a production is used to determine its precedence. For "E + E", this would be "+".
Feb
1
comment How to extract operators from the grammar productions for conflict resolution in LALR parser?
Might you be asking the following: suppose we have a shift-reduce conflict, say between shifting '*' and reducing "E * E", how do I determine the 'operator' of "E * E" so that I can apply the priorities that the user defined? In other words, are you having trouble unifying that you only define priorities between operators, while shift-reduce conflicts are conflicts between operators on one hand and productions on the other hand?
Jan
19
comment First and Follow Sets for a Grammar
When I said "I'm not entirely sure how to answer your question", I meant that I'm not sure how to 'prove' that your solution is really correct. I'm quite sure they are correct though, having implemented a compiler and multiple parsing algorithms myself. Anyway, I hope you did well on your exam.
Jan
19
comment First and Follow Sets for a Grammar
I've checked your solution by hand and ran it in my parsing library, and it is correct. I'm not entirely sure how to answer your question.
Dec
1
comment How lookaheads are propagated in “channel” method of building LALR parser?
I think cs.stackexchange.com is probably the site where you're most likely to get a good answer for these kinds of questions.
Nov
20
comment LL(∞) and left-recursion
I think three of your questions are answered by this post: cs.stackexchange.com/a/48/92. For the rest I also recommend you start questions over at that site. Don't forget to specify 'better' more precisely.
Nov
13
awarded  Yearling
Oct
24
awarded  Enlightened
Oct
2
comment Programmaticaly finding the Landau notation (Big O or Theta notation) of an algorithm?
For proofs that deciding running times is in general impossible, see here and here - the answers there prove even more than you ask for, actually.
Aug
5
answered What does it mean by expected running time and average runnnig time of an algorithm?
Jun
8
awarded  Caucus
Apr
27
comment Merge sort versus quick sort performance
Try this question: cs.stackexchange.com/questions/3/…
Feb
22
awarded  Nice Answer
Feb
12
comment What language does Introduction to Algorithms by Cormen use?
I'm pretty sure they use the language 'English' in that book, but translations are probably available.
Feb
5
awarded  Analytical