Sciweavers

762 search results - page 26 / 153
» Intercode Regular Languages
Sort
View
COLING
1994
14 years 5 days ago
Parsing A Flexible Word Order Language
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their ...
Vladimir Pericliev, Alexander Grigorov
ACL
2004
14 years 7 days ago
Alternative approaches for Generating Bodies of Grammar Rules
We compare two approaches for describing and generating bodies of rules used for natural language parsing. In today's parsers rule bodies do not exist a priori but are genera...
Gabriel G. Infante López, Maarten de Rijke
ICTAC
2009
Springer
14 years 5 months ago
Regular Expressions with Numerical Constraints and Automata with Counters
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
Dag Hovland
ICFP
2004
ACM
14 years 10 months ago
Regular expression patterns
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
Niklas Broberg, Andreas Farre, Josef Svenningsson
POPL
2006
ACM
14 years 11 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon