> Note that Context Free Grammars tend to be ambiguous, in traditional > programming environments we typically want a Parsing Expression > Grammar. And we probably need "cloud sized resources" to adequately > tackle natural language parsing.
I have only little familiarity with PEGs; I'm not sure what is the set of recognizable languages for PEG, comparing to LL/LR/generalized LR. Can you recommend good resources on that? > These are related issues -- we could imagine a transforming operation > in J (analogous to f.) which lifts unnecessary conditionals out of > loops, to make serial processing more efficient. [And we could also > imagine a transforming operation for the purpose of deploying > something written in J into a GPU, or whatever.] We do not currently > have that, but it's doable -- the trick to getting started would be to > start small. That would be very interesting - such a transforming operation... > There are also many different kinds of trees. I need only very basics - a tree is many elements, each having exactly one parent, with singular exception of the root. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
