3440 search results - page 15 / 688 » Logics For Context-Free Languages |
WCRE
1997
IEEE
15 years 2 months ago
1997
IEEE
We present an approach for the generation of components for a software renovation factory. These components are generated from a context-free grammar definition that recognizes t...
COLING
2000
14 years 11 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
ACL
1993
14 years 11 months ago
1993
This paper introduces a tree generating system called Lexicalized Context-Free Grammar (LCFG) and describes a cubic-time parser for it. LCFG embeds the elegance of the analyses fo...
DLT
2004
14 years 11 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
137
click to vote
CPP
2011
13 years 9 months ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...