• From: u123724 <u123724@g...>
• To: "Costello, Roger L." <costello@m...>
• Date: Mon, 28 Nov 2016 19:11:50 +0100

As you'll know the grammar formalisms for markup languages aren't
designed to represent general context-free grammars, but only regular
tree languages (= regular languages over content model tokens).

Within these constraints, XML DTDs do exactly what you want, in a
kindof Backus-Naur format (that could be hacked to look like Backus-Naur
even more using parameter entities I guess).

Though, compared to general BNFs for regular languages, they can
only express 1-unambiguous grammars. But since you said you want
XSDs as output, that might not be a problem for your application,
as valid XSDs share these restriction with DTDs (though formally,
XSDs can represent a slightly larger class of grammars than DTDs).

On Mon, Nov 28, 2016 at 5:50 PM, Costello, Roger L. <costello@m...> wrote:
> Hi Folks,
>
> Have you devised an approach for encoding in XML any BNF grammar?
>
> If yes, have you written an XSLT program that can convert any XML-encoded BNF grammar into XSD?
>
> /Roger
>
> _______________________________________________________________________
>
> XML-DEV is a publicly archived, unmoderated list hosted by OASIS
> to support XML implementation and development. To minimize
> spam in the archives, you must subscribe before posting.
>
> [Un]Subscribe/change address: http://www.oasis-open.org/mlmanage/
> Or unsubscribe: xml-dev-unsubscribe@l...
> subscribe: xml-dev-subscribe@l...
> List archive: http://lists.xml.org/archives/xml-dev/
> List Guidelines: http://www.oasis-open.org/maillists/guidelines.php

• References:
  • Auto-convert an XML-encoding of BNF grammars into XSD?
    • From: "Costello, Roger L." <costello@m...>