On Fri, Nov 16, 2012 at 1:01 PM, Alexander Mikhailov <[email protected]> wrote: >> 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?
My understanding is that the same set is recognizable. Also, I've never implemented anything using PEG myself -- I am mostly familiar with it from conversations with friends. >> 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. A list of indices, one for each child, where the index identifies the child's parent, satisfies this description. (Looks like Devon has explained this same idea in greater detail.) FYI, -- Raul -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
