An Operational Model for Parsing De.nite Clause Grammars with In.nite Terms (original) (raw)
David Cabrero Souto1999, Lecture Notes in Computer Science
visibility
…
description
19 pages
link
1 file
AI-generated Abstract
An operational model is proposed for effectively parsing definite clause grammars that may contain infinite terms. The model addresses the complexities often encountered when working with these grammars, leading to enhanced parsing performance and efficiency.