jurgenv

3 ms·

1.
by jurgenv 7y ago
GLR, GLL and Earley's parser (with the tree construction) are labeled "context-free general" parsing algorithms because they can handle _any_ context-free grammar while the other algorithms associated with sub-classes of CFGs
2.
by jurgenv 7y ago
Working with code Analysis and transformation techniques at the same time was always about glueing database and logic progressing tech to functional programming and algebraic specification tech for us. Just having those linguistically integ
3.
by jurgenv 7y ago
Goals are often similar, but methods very different. Epsilon and Rascal share many design decisions. Rascal is based fully on immutable data, including relations, while the EMF is based on objects.
4.
by jurgenv 7y ago
What was developed in IBM time and what was written as Eclipse plugin is EPL. The rest is BSD2.
5.
by jurgenv 7y ago
That was version 0.1 bootstrapped off SDF2. Since 2009 Rascal is based on a topdown general algorithm calked GLL. It's still Scannerless with declarative disambiguation, like SGLR. Currently it's evolving to data-dependent GLL to
6.
by jurgenv 10y ago
CodeBuff is also learning from examples. Check out the paper at the SLE conf; it has all the nitty gritty details how it learns the whitespace rules from the example files.
7.
by jurgenv 10y ago
haven't tried, but if you train it using only correct Python I bet it can only produce correct Python. Have to check this out to be totally sure of the absence of a weird corner case.
8.
by jurgenv 10y ago
The grammar is used to compute the code layout features that CodeBuff learns from: it parses each file and associates spacing and indentation features to trees' contextual features. Then, when we parse a new file to pretty-print, we pa
9.
by jurgenv 10y ago
It's language parametric, so it can work for any language you have a grammar for and a set of example files to train on. In this sense it helps the authors of formatting tools. For the users for a specific language it could also be an