Security applications of formal language theory
We present a formal language theory approach to improving the security aspects of protocol
design and message-based interactions in complex composed systems. We argue that …
design and message-based interactions in complex composed systems. We argue that …
Analyzing context-free grammars using an incremental SAT solver
We consider bounded versions of undecidable problems about context-free languages
which restrict the domain of words to some finite length: inclusion, intersection, universality …
which restrict the domain of words to some finite length: inclusion, intersection, universality …
Analyzing ambiguity of context-free grammars
It has been known since 1962 that the ambiguity problem for context-free grammars is
undecidable. Ambiguity in context-free grammars is a recurring problem in language design …
undecidable. Ambiguity in context-free grammars is a recurring problem in language design …
Analyzing ambiguity of context-free grammars
It has been known since 1962 that the ambiguity problem for context-free grammars is
undecidable. Ambiguity in context-free grammars is a recurring problem in language design …
undecidable. Ambiguity in context-free grammars is a recurring problem in language design …
Parsing Ambiguous Grammar-A Survey
J Sowmith, LA Dasari, NK Mamidi… - 2024 15th International …, 2024 - ieeexplore.ieee.org
This survey is aimed at showing different ways of, how some linguists try to get rid of the
ambiguity feature of the syntax, but there are some or no techniques for checking whether …
ambiguity feature of the syntax, but there are some or no techniques for checking whether …
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 …
Some ambiguity is intentional while other ambiguity is accidental. A good grammar …
Ambiguity detection for programming language grammars
B Basten - 2011 - theses.hal.science
Context-free grammars are the most suitable and most widely used method for describing
the syntax of programming languages. They can be used to generate parsers, which …
the syntax of programming languages. They can be used to generate parsers, which …
An experimental ambiguity detection tool
S Schmitz - Science of Computer Programming, 2010 - Elsevier
Although programs convey an unambiguous meaning, the grammars used in practice to
describe their syntax are often ambiguous, and completed with disambiguation rules …
describe their syntax are often ambiguous, and completed with disambiguation rules …
Extracting high-quality end-user requirements via a chatbot elicitation assistant
MP Valkenier - 2020 - studenttheses.uu.nl
Requirements elicitation can be done using several methods, depending on what segment
of users one would want to target. This thesis studies whether a chatbot can be used to elicit …
of users one would want to target. This thesis studies whether a chatbot can be used to elicit …
Grammatical inference in the discovery of generating functions
In this paper an algorithm for the induction of a context-free grammar is proposed, and its
application in obtaining a generating function for the number of certain combinatorial objects …
application in obtaining a generating function for the number of certain combinatorial objects …