• From: "K.Kawaguchi" <k-kawa@b...>
• To: Murata Makoto <mura034@a...>
• 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
with TREX.


regards,
----------------------
K.Kawaguchi
E-Mail: k-kawa@b...

• Follow-Ups:
  • Re: Type-assignment
    • From: Murata Makoto <mura034@a...>

• References:
  • Type-assignment (was Re: Are we losing out because of grammars?)
    • From: Murata Makoto <mura034@a...>

• Prev by Date: Type-assignment (was Re: Are we losing out because of grammars?)
• Next by Date: Re: Are we losing out because of grammars?
• Previous by thread: Type-assignment (was Re: Are we losing out because of grammars?)
• Next by thread: Re: Type-assignment
• Index(es):
  • Date
  • Thread