Skip to Main Content
Table 2 

Computing the production rules of an LCFRS in which all yield functions satisfy Property 4.

Input: a linear context-free rewriting system G = (N, Σ, P, S
1: P′ ← ∅; agenda ← {(S, 〈x〉)}; chart ← ∅ 
2: whileagenda is not empty 
3:  remove some (A, g) from agenda 
4:  if (A, g) ∉ chartthen 
5:   add (A, g) to chart 
6:   for each rule Af(A1, …, Am) ∈ Pdo 
7:    freduce(f, g); giadapt(f, g, i) (1 ≤ im
8:    for eachi from 1 to mdo 
9:     add (Ai, gi) to agenda 
10:    add (A, g) → f′((A1, g1), …, (Am, gm)) to P′ 
Input: a linear context-free rewriting system G = (N, Σ, P, S
1: P′ ← ∅; agenda ← {(S, 〈x〉)}; chart ← ∅ 
2: whileagenda is not empty 
3:  remove some (A, g) from agenda 
4:  if (A, g) ∉ chartthen 
5:   add (A, g) to chart 
6:   for each rule Af(A1, …, Am) ∈ Pdo 
7:    freduce(f, g); giadapt(f, g, i) (1 ≤ im
8:    for eachi from 1 to mdo 
9:     add (Ai, gi) to agenda 
10:    add (A, g) → f′((A1, g1), …, (Am, gm)) to P′ 
Close Modal

or Create an Account

Close Modal
Close Modal