Syntax Analysis and Error Recovery. - Pierre Boullier (Method and tools for compiler construction, 1983)

A New Error Repair and Recovery Scheme for Lexical and Syntactic Analysis. - Pierre Boullier; Martin Jourdan (Sci. Comput. Program., 1987)

Yet Another $0(n^6)$ Recognition Algorithm for Mildly Context-Sensitive Languages. - Pierre Boullier (IWPT, 1995)

Another Facet of LIG Parsing. - Pierre Boullier (ACL, 1996)

A generalization of mildly context-sensitive formalisms. - Pierre Boullier (TAG+, 1998)

Chinese Numbers, MIX, Scrambling, and Concatenation Grammars Range. - Pierre Boullier (EACL, 1999)

Range Concatenation Grammars. - Pierre Boullier (IWPT, 2000)

A Cubic Time Extension of Context-Free Grammars. - Pierre Boullier (Grammars, 2000)

Guided Parsing of Range Concatenation Languages. - François Barthélemy; Pierre Boullier; Philippe Deschamp; Éric Villemonte de la Clergerie (ACL, 2001)

Atelier ATOLL pour les grammaires d'arbres adjoints. - François Barthélemy; Pierre Boullier; Philippe Deschamp; Linda Kaouane; Éric Villemonte de la Clergerie (TALN (Articles longs), 2001)

From Contextual Grammars to Range Concatenation Grammars. - Pierre Boullier (FGMOL, 2001)

Guided Earley Parsing. - Pierre Boullier (IWPT, 2003)

Supertagging: A Non-Statistical Parsing-Based Approach. - Pierre Boullier (IWPT, 2003)

Counting with range concatenation grammars. - Pierre Boullier (Theor. Comput. Sci., 2003)

Les Grammaires à Concaténation d'Intervalles (RCG) comme formalisme grammatical pour la linguistique. - Benoît Sagot; Pierre Boullier (TALN (Articles longs), 2004)

Efficient and Robust LFG Parsing: SxLFG. - Pierre Boullier; Benoît Sagot (IWPT, 2005)

Chaînes de traitement syntaxique. - Pierre Boullier; Lionel Clément; Benoît Sagot; Éric Villemonte de la Clergerie (TALN (Articles longs), 2005)

Un analyseur LFG efficace pour le français : SXLFG. - Pierre Boullier; Benoît Sagot; Lionel Clément (TALN (Articles courts), 2005)

Deep non-probabilistic parsing of large corpora. - Benoît Sagot; Pierre Boullier (LREC, 2006)

The Lefff 2 syntactic lexicon for French: architecture, acquisition, use. - Benoît Sagot; Lionel Clément; Éric Villemonte de la Clergerie; Pierre Boullier (LREC, 2006)

Are Very Large Context-Free Grammars Tractable? - Pierre Boullier; Benoît Sagot (IWPT, 2007)

S XPipe 2: an architecture for surface preprocessing of raw corpora. - Benoît Sagot; Pierre Boullier (Trait. Autom. des Langues, 2008)

Multi-Component Tree Insertion Grammars. - Pierre Boullier; Benoît Sagot (FG, 2009)

Constructing parse forests that include exactly the n-best PCFG trees. - Pierre Boullier; Alexis Nasr; Benoît Sagot (IWPT, 2009)

Parsing Directed Acyclic Graphs with Range Concatenation Grammars. - Pierre Boullier; Benoît Sagot (IWPT, 2009)

MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars (Application Note). - Srinivas Bangalore; Pierre Boullier; Alexis Nasr; Owen Rambow; Benoît Sagot (HLT-NAACL (Short Papers), 2009)

Are Very Large Context-Free Grammars Tractable? - Pierre Boullier; Benoît Sagot (Trends in Parsing Technology, 2010)