135 reputation
4
bio website norswap.eu
location Belgium
age
visits member for 1 year, 10 months
seen Sep 13 '13 at 0:41

Apr
3
answered Why can't we use memoization to parse unambiguous context-free grammars in linear time?
Jul
15
comment Why can't we use memoization to parse unambiguous context-free grammars in linear time?
Interesting. What has always annoyed me when working with grammars tough is that when using restricted classes, it's pretty hard to see if a grammar belongs to that class, or to make up a grammar for your language that falls directly in the class.
Jul
15
accepted Why can't we use memoization to parse unambiguous context-free grammars in linear time?
Jul
14
revised Why can't we use memoization to parse unambiguous context-free grammars in linear time?
added 94 characters in body
Jul
14
revised Why can't we use memoization to parse unambiguous context-free grammars in linear time?
added 643 characters in body
Jul
14
comment Why is it hard to parse unambiguous context-free grammar in linear time?
Great answer! I've posted a follow up question here: math.stackexchange.com/questions/170902 , maybe you could have a look ?
Jul
14
asked Why can't we use memoization to parse unambiguous context-free grammars in linear time?
Jul
14
accepted Why is it hard to parse unambiguous context-free grammar in linear time?
Jun
20
asked Why is it hard to parse unambiguous context-free grammar in linear time?
Jun
13
awarded  Supporter
Jun
13
awarded  Scholar
Jun
13
accepted Determining if a grammar can be converted to LL(1)/LL(k)
Jun
10
awarded  Editor
Jun
10
revised Determining if a grammar can be converted to LL(1)/LL(k)
removed redundant info
Jun
10
comment Determining if a grammar can be converted to LL(1)/LL(k)
Thanks a lot :)
Jun
8
awarded  Student
Jun
8
asked Determining if a grammar can be converted to LL(1)/LL(k)