STAG-AUTOSCHEMA(1p)

✨ NAME ✨

okay so bestie, welcome to stag-autoschema — she writes the implicit stag-schema for a stag file 💖 no cap, that's the whole gig.

---

🌸 SYNOPSIS 🌸

stag-autoschema -w sxpr sample-data.xml

stag-autoschema -dtd sample-data.xml

---

🦋 DESCRIPTION 🦋

So here's the vibe: you hand her a stag compatible file — that's xml, sxpr, or itext — or honestly any format at all as long as you also give her a parser, and she'll write out the implicit underlying stag-schema for you. slay.

ngl, stag-schema should look relatively self-explanatory. periodt.

Here's an example stag-schema, shown in sxpr syntax:

(db
 (person*
  (name "s"
  (address+
   (address_type "s")
   (street "s")
   (street2? "s")
   (city "s")
   (zip? "s")))))

okay so let's decode this iconic little tree 🌈: the database db contains zero or more persons, each person has a mandatory name and at least one address. she ate.

The cardinality mnemonics are as follows:

• + — 1 or more
• ? — 0 or one
• * — 0 or more

and the default cardinality is 1 💅

---

💅 ARGUMENTS 💅

• -p|parser FORMAT — FORMAT is one of xml, sxpr or itext, or the name of a perl module. and jsyk, xml is assumed as default 👑
• -dtd — exports schema as DTD 🎀
• -w|writer FORMAT — FORMAT is one of xml, sxpr or itext, or the name of a perl module, OR DTD. the default is sxpr. note that stag schemas exported as xml will be invalid xml, due to the use of symbols *, +, ? in the node names — yeah bestie, that's real, not a drill 😭

---

💀 LIMITATIONS 💀

not event based — memory usage becomes exhorbitant on large files; prepare a small sample beforehand 🙈 like fr fr, bring a snack-sized sample, your RAM will thank you.

---

perl v5.34.0 · 2022-06-12 — that's the whole lore, written on that date, running on that perl, and that's a wrap bestie 🫶✨ bye ily 💖