Key points are not available for this paper at this time.
This paper describes a system in PROLOG for the automatic transforlmttion of a grammar, written in LFG formalism, into a DCG-based parser. It demonstrates the main principles of the transformation, the representation of f-structures and constraints, the treatment of long-distance dependencies, and left recursion.
Eisele et al. (Wed,) studied this question.