出典:Wikipedia
出典:『Wikipedia』 (2011/01/30 00:06 UTC 版)
In natural language processing, deterministic parsing refers to parsing algorithms that do not back up. LR-parsers are an example. (This meaning of the words "deterministic" and "non-deterministic" differs from that used to describe nondeterministic algorithms.)