Skip Nav Destination
Article navigation
June 01 2002
Efficient Processing with Constraint-Logic Grammars Using Grammar Compilation
Efficient Processing with Constraint-Logic Grammars Using Grammar Compilation
Guido
Minnen
(Motorola Labs) Stanford
: CSLI Publications
(Stanford monographs in linguistics), 2001
, viii+255 pp; distributed by University of Chicago Press
; hardbound, ISBN 1-57586-305-7, $55.00, £35.00; paperbound, ISBN 0-57586-306-5, $20.00, £13.00
Suresh Manandhar
Suresh Manandhar
University of York
Search for other works by this author on:
Suresh Manandhar
University of York
Online Issn: 1530-9312
Print Issn: 0891-2017
© 2002 Association for Computational Linguistics
2002
Computational Linguistics (2002) 28 (2): 224–228.
Citation
Suresh Manandhar; Efficient Processing with Constraint-Logic Grammars Using Grammar Compilation. Computational Linguistics 2002; 28 (2): 224–228. doi: https://doi.org/10.1162/coli.2002.28.2.224
Download citation file:
8
Views
0
Citations
Cited By
Related Articles
Related Book Chapters
Performance of the Compiler-based Andorra-I System
Logic Programming: Proceedings of the Tenth International Conference on Logic Programming June 21-24, 1993, Budapest, Hungary
Native Code Compilation in SICStus Prolog
Logic Programming: The 11th International Conference
Compiling Control Revisited: A New Approach based upon Abstract Interpretation
Logic Programming: The 11th International Conference
Operational Semantics of Constraint Logic Programs with Coroutining
Logic Programming: The 12th International Conference
Advertisement
