# Dump of the concrete grammar and the transformations
fun pretty: String
do
- var res = new Buffer
+ var res = new FlatBuffer
for p in prods do
if p.spe != null then
res.append("{p.name} \{-> {p.spe.name}\}=\n")
if a == last then res.append(" ;\n") else res.append(" |\n")
end
if p.is_nullable then res.append "\t// is nullable\n"
- if not p.firsts.is_empty then res.append "\t// firsts: {p.firsts.join(" ")}\n"
- if not p.afters.is_empty then res.append "\t// afters: {p.afters.join(" ")}\n"
+ if not p.firsts.is_empty then
+ res.append "\t// firsts:\n"
+ for x in p.firsts do res.append "\t// {x}\n"
+ end
+ if not p.afters.is_empty then
+ res.append "\t// afters:\n"
+ for x in p.afters do res.append "\t// {x}\n"
+ end
end
return res.to_s
end
res.add "s{s.number} {s.name}\n"
res.add "\tCORE\n"
for i in s.core do
- res.add "\t\t{s.item_to_s(i)}\n"
+ res.add "\t\t{i}\n"
+ if i.next != null then continue
+ for i2 in s.lookahead(i) do
+ res.add "\t\t\t{i2}\n"
+ end
end
res.add "\tOTHER ITEMS\n"
for i in s.items do
if s.core.has(i) then continue
- res.add "\t\t{s.item_to_s(i)}\n"
+ res.add "\t\t{i}\n"
+ if i.next != null then continue
+ for i2 in s.lookahead(i) do
+ res.add "\t\t\t{i2}\n"
+ end
end
res.add "\tTRANSITIONS {s.outs.length}\n"
for t in s.outs do
for s in states do
f.write "s{s.number} [label=\"{s.number} {s.name.escape_to_dot}|"
for i in s.core do
- f.write "{s.item_to_s(i).escape_to_dot}\\l"
+ f.write "{i.to_s.escape_to_dot}\\l"
end
f.write("|")
for i in s.items do
if s.core.has(i) then continue
- f.write "{s.item_to_s(i).escape_to_dot}\\l"
+ f.write "{i.to_s.escape_to_dot}\\l"
end
f.write "\""
if not s.is_lr0 then
return i.alt.prod.afters
end
- fun item_to_s(i: Item): String
- do
- var l = lookahead(i)
- if l.is_empty then return i.to_s
- return "{i} \{ {l.join(" ")} \}"
- end
-
# Set of all reductions
var reduces = new ArraySet[Alternative]
# Set of all shifts
for t, a in guarded_reduce do
if a.length > 1 then
print "REDUCE/REDUCE Conflict on state {self.number} {self.name} for token {t}:"
- for i in a do print "\t{i}"
+ for i in a do print "\treduce: {i}"
else if guarded_shift.has_key(t) then
- print "SHIFT/REDUCE Conflict on state {self.number} {self.name} for token {t}:"
- for i in a do print "\t{i}"
- for i in guarded_shift[t] do print "\t{i}"
+ var ri = a.first
+ var confs = new Array[Item]
+ var ress = new Array[String]
+ var g = guarded_shift[t]
+ for si in lookahead(ri) do
+ if si.next != t then continue
+ if not g.has(si) then
+ confs.add(si)
+ continue
+ end
+ var p = ri.alt.prod
+ var csi: nullable Item = null
+ for bsi in back_expand(si) do
+ if bsi.alt.prod == p then
+ csi = bsi
+ break
+ end
+ end
+ if csi == null then
+ confs.add(si)
+ continue
+ end
+ ress.add "\tshift: {si}"
+ if si != csi then
+ ress.add "\tcore shift: {csi}"
+ end
+ end
+ if confs.is_empty then
+ print "Automatic Dangling on state {self.number} {self.name} for token {t}:"
+ print "\treduce: {ri}"
+ for r in ress do print r
+ guarded_reduce.keys.remove(t)
+ else
+ print "SHIFT/REDUCE Conflict on state {self.number} {self.name} for token {t}:"
+ print "\treduce: {ri}"
+ for i in guarded_shift[t] do print "\tshift: {i}"
+ end
+ end
+ end
+ end
+
+ # Return `i` and all other items of the state that expands, directly or undirectly, to `i`
+ fun back_expand(i: Item): Set[Item]
+ do
+ var res = new ArraySet[Item]
+ var todo = [i]
+ res.add(i)
+ while not todo.is_empty do
+ var x = todo.pop
+ if x.pos > 0 then continue
+ var p = x.alt.prod
+ for y in items do
+ if y.next != p then continue
+ if res.has(y) then continue
+ res.add(y)
+ todo.add(y)
end
end
+ return res
end
end
redef fun to_s
do
- var b = new Buffer
+ var b = new FlatBuffer
b.append("{alt.prod.name}::{alt.name}=")
for i in [0..alt.elems.length[
do
nitlanguage / nit.git / blobdiff