User loginNavigation |
archivesOwl: A parser generator for visibly pushdown languages.Owl is a parser generator which targets the class of visibly pushdown languages. It is:
The restriction to visibly pushdown languages imposes restrictions on recursion. Rules can only refer to later rules, not earlier ones, and all recursion must be guarded inside guard brackets. [ begin ... end ] The symbols just inside the brackets are the begin and end tokens of the guard bracket. Begin and end tokens can't appear anywhere else in the grammar except as other begin and end tokens. This is what guarantees the language is visibly pushdown: all recursion is explicitly delineated by special symbols. Note: I am not the Owl author, but I found it to be a useful tool for my own projects. I play around with toy programming languages as a hobby and I am not well-versed on automata theory. I am posting here because I would be interested to know what your thoughts are about the class of visibly pushdown languages, specifically the constraints it imposes on recursion, how that compares to recursive descent, and any pointers to variations or similar approaches that you know of. By helltone at 2020-05-02 08:21 | LtU Forum | login or register to post comments | other blogs | 2932 reads
|
Browse archivesActive forum topics |
Recent comments
3 hours 10 min ago
14 hours 8 min ago
19 hours 57 min ago
20 hours 17 min ago
20 hours 47 min ago
21 hours 33 min ago
21 hours 57 min ago
22 hours 25 min ago
23 hours 58 min ago
1 day 23 min ago