It is well known that hyperedge-replacement grammars can generate NP-complete graph languages
even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the
non-uniform setting, in which the grammar is considered to be fixed rather than being part of the
input. Little is known about restrictions under which truly uniform polynomial parsing is possible.
In this paper we propose a low-degree polynomial-time algorithm that solves the uniform parsing
problem for a restricted type of hyperedge-replacement grammars which we expect to be of interest
for practical applications.