This article evaluates the efficiency of the LiLFeS abstract machine by performing parsing
tasks with the LinGO English resource grammar. The instruction set of the abstract machine
is optimized for efficient processing of definite clause programs and typed feature structures.
LiLFeS also supports various tools required for efficient parsing (e.g. efficient copying, a
built-in CFG parser) and the constructions of standard Prolog (e.g. cut, assertions, negation
as failure). Several parsers and large-scale grammars, including the LinGO grammar, have
been implemented in or ported to LiLFeS. Precise empirical results with the LinGO grammar
are provided to allow comparison with other systems. The experimental results demonstrate
the efficiency of the LiLFeS abstract machine.