Sciweavers

376 search results - page 15 / 76
» Grammar Development in GF
Sort
View
ASAP
2004
IEEE
127views Hardware» more  ASAP 2004»
14 years 14 days ago
A Public-Key Cryptographic Processor for RSA and ECC
We describe a general-purpose processor architecture for accelerating public-key computations on server systems that demand high performance and flexibility to accommodate large n...
Hans Eberle, Nils Gura, Sheueling Chang Shantz, Vi...
LDTA
2010
13 years 9 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
LREC
2008
155views Education» more  LREC 2008»
13 years 10 months ago
OpenCCG Workbench and Visualization Tool
Combinatorial Category Grammar is (CCG) a lexicalized grammar formalism which is expressed by syntactic category, a logical form representation. There are difficulties in represen...
Thepchai Supnithi, Suchinder Singh, Taneth Ruangra...
SYNASC
2008
IEEE
267views Algorithms» more  SYNASC 2008»
14 years 3 months ago
Grammar-Based Automatic Extraction of Definitions
This paper presents part of our work in the LT4eL project [1] regarding the grammar developed by the Romanian team in order to extract definitions from texts. Some qualitative res...
Adrian Iftene, Ionut Pistol, Diana Trandabat
CPP
2011
107views more  CPP 2011»
12 years 8 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
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...
Tom Ridge