36 search results - page 6 / 8 » Unambiguous Boolean grammars |
LPAR
2001
Springer
14 years 2 days ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
ISMB
1993
13 years 9 months ago
1993
Wedescribe various methods designed to discover knowledge in the GenBanknucleic acid sequence database. Using a grammatical model of gene structure, we create a parse tree of a ge...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
ISSRE
2002
IEEE
14 years 17 days ago
2002
IEEE
An important aspect of developing models relating the number and type of faults in a software system to a set of structural measurement is defining what constitutes a fault. By de...
IAW
2003
IEEE
14 years 28 days ago
2003
IEEE
— Vulnerabilities in software stem from poorly written code. Inadvertent errors may creep in due to programmers not being aware of the security implications of their code. Writin...