On Fri, Oct 9, 2009 at 2:28 AM, Oleg Kobchenko <[email protected]> wrote: > It was good to point that out. However, the problem is not > the length of the input. What I illustrated is the length > of a production, which is really infinite. However a production > can be infinite in FSA-covered grammar (e.g. a J name).
PDA production represented as an FSM might be exponentially larger, but I do not believe it's infinite. > It should be possible to have a generic PDA working similarly to > FSA as implemented in dyadic ;: . I am not quite sure how this would work. -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
