Grammar flow analysis

Toward an engineering discipline for grammarware

“…And so on. We presume that the development of a comprehensive framework for grammarware properties can be based on existing work for grammar-flow analysis [Mönck and Wilhelm 1991;Jeuring and Swierstra 1994]. And so on.…”

On generalized authorization problems

“…We use the language characterizations of transition sequences, together with previously known results on a certain kind of grammar problem [46,34] to obtain a solution to the GPR problem.…”

“…To solve the GPR problem, we appeal to the following theorem: Theorem 6.2 [46,34] The abstract grammar problem for G and (S, ) can be solved by an iterative computation that finds the maximum fixed point, when the following conditions hold:…”

“…The general strategy is as follows: the set of labeled SPKI/SDSI certificates is first translated to a weighted pushdown system. 1 After the translation, the answer is obtained by solving a generalized shortest-path problem [27,46,34].…”

Grammar Analysis and Parsing by Abstract Interpretation

“…This includes Knuth's grammar problem [1,2], grammar decision problems such as emptiness and finiteness [3], and classical compilation algorithms such as First and Follow [4]. For the later case, Ulrich Möncke and Reinhard Wilhelm introduced grammar flow analysis to solve computation problems over context-free grammars [5,6,7], [8,Sect. 8.2.4].…”