A modula-2-like systems programming language and its implementation. - Javier Miranda; José Fortes Gálvez (Microprocessing and Microprogramming, 1991)

Generating LR(1) Parsers of Small Size. - José Fortes Gálvez (CC, 1992)

A Note on a Proposed LALR Parser for Extended Context-Free Grammars. - José Fortes Gálvez (Inf. Process. Lett., 1994)

A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning. - José Fortes Gálvez (Developments in Language Theory, 1995)

A Basis for Looping Extensions to Discriminating-Reverse Parsing. - Jacques Farré; José Fortes Gálvez (CIAA, 2000)

A Bounded Graph-Connect Construction for LR-regular Parsers. - Jacques Farré; José Fortes Gálvez (CC, 2001)

Practical Nondeterministic DR(k) Parsing on Graph-Structured Stack. - José Fortes Gálvez; Jacques Farré; Miguel Ángel Pérez Aguiar (CICLing, 2001)

Generalized epsilon-Skip Discriminating-Reverse Parsing on Graph-Structured Stack. - José Fortes Gálvez; Jacques Farré (IWPT, 2001)

Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers. - Jacques Farré; José Fortes Gálvez (CIAA, 2001)

Bounded-connect noncanonical discriminating-reverse parsers. - Jacques Farré; José Fortes Gálvez (Theor. Comput. Sci., 2004)

Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time. - José Fortes Gálvez; Sylvain Schmitz; Jacques Farré (CIAA, 2006)

Incorporating Precise Garbage Collection in an Ada Compiler. - Francisco García-Rodríguez; Javier Miranda; José Fortes Gálvez (Ada-Europe, 2007)