DTD problem: transforming cyclic graph into element definitions

Y

Yves Forkl

I need to transform a directed cyclic graph into a DTD. My approach is
to have one element Pn for each "production" number n, with the
content model comprising the starting vertex number n and the
subsequent productions. For e.g., for vertex V1 and its edges leading
to V4 and V7, I would get:

<!ELEMENT P1 (V1, (P4 | P7)) >

For the following part of the graph I can't come up with the two
content models because I always run into illegal recursive structures:

Pa: Va -> Va | Vb | Vc
Pb: Vb -> Va | Vc

Maybe someone has an suggestion for legally recursive content models
for Pa and Pb?

Yves
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

No members online now.

Forum statistics

Threads
473,744
Messages
2,569,483
Members
44,901
Latest member
Noble71S45

Latest Threads

Top