[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- From: "K.Kawaguchi" <firstname.lastname@example.org>
- To: Murata Makoto <email@example.com>
- Date: Thu, 01 Feb 2001 19:51:31 -0800
> > It's not in general easy, unless you restrict the grammar. For example,
> > consider the following TREX pattern:
> Right. Kawaguchi-san's another algorithm determines if a RELAX module is
> already such a restricted grammar.
I don't think so. It is true that a restricted grammar results in
FASTER algorithm, but it's also true that type-assignment is still
tractable and in fact quite simple even for unrestricted grammars.
See my previous post to Norm, which describes it step by step. It works