# Tag Info

0

by augmented grammar I am assuming the production rule S'->S. The purpose of augmented grammar is just to make the process of computing the go-to graph homogeneous for all nodes, it actually isn't a part of the grammar, so you dont need to compute its follows. Even if you did, it won't matter unless you are taking it as a part of the grammar, which in ...

2

I recently had the same question in mind when reading Pager's work. I found the paper The Edge-Pushing LR(k) Algorithm by Chen and Pager, which seems to say that the two terms are indeed the same. Quoting that paper: The concepts of state, configuration and theads(α, k) used here are equivalent to “item set”, “item” and FIRSTk(α) correspondingly in some ...

0

When I follow the algorithm steps, these are the Earley states I get:  \begin{array}{|c|} \hline S_{0}\\ \hline \begin{array}{ccc|c} (1) & Z\to\bullet S & ,0 & \text{start rule}\\ (2) & S\to\bullet a & ,0 & \text{predict from (1)}\\ (3) & S\to\bullet b & ,0 & \text{predict from (1)}\\ (4) & S\to\bullet c & ,0 &...

Top 50 recent answers are included