<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
<?rfc symrefs="yes"?>
<?rfc sortrefs="no"?>
<?rfc compact="yes"?>
<?rfc toc="yes"?>
<?rfc subcompact="no"?>
<?rfc comments="yes"?>
<?rfc inline="yes"?>
<?rfc-ext allow-markup-in-artwork="yes"?>
<rfc number="2234" category="std" xmlns:grddl='http://www.w3.org/2003/g/data-view#' grddl:transformation='rfc2629grddl.xslt'>
  <front>
    <title abbrev='ABNF for Syntax Specifications'>Augmented BNF for Syntax Specifications: ABNF</title>
    <author initials='D.' surname='Crocker' fullname='David H. Crocker' role="editor">
      <organization>Internet Mail Consortium</organization>
      <address>
        <postal>
        <street>675 Spruce Dr.</street>
        <city>Sunnyvale</city>
        <region>CA</region>
        <code>94086</code>
        <country>US</country></postal>
        <phone>+1 408 246 8253</phone>
        <facsimile>+1 408 249 6205</facsimile>
        <email>dcrocker@imc.org</email>
      </address>
    </author>
    <author initials='P.' surname='Overell' fullname='Paul Overell'>
      <organization>Demon Internet Ltd.</organization>
      <address>
        <postal>
          <street>Dorking Business Park</street>
          <street>Dorking</street>
          <city>Surrey</city>
          <region>England</region>
          <code>RH4 1HN</code>
          <country>UK</country>
        </postal>
        <email>paulo@turnpike.com</email>
      </address>
    </author>
    <date month='November' year='1997' />
    <keyword>ABNF</keyword>
    <keyword>Augmented</keyword>
    <keyword>Backus-Naur</keyword>
    <keyword>Form</keyword>
    <keyword>electronic</keyword>
    <keyword>mail</keyword> 
  </front>
<middle>

<section title="INTRODUCTION">
<t>
   Internet technical specifications often need to define a format
   syntax and are free to employ whatever notation their authors deem
   useful.  Over the years, a modified version of Backus-Naur Form
   (BNF), called Augmented BNF (ABNF), has been popular among many
   Internet specifications.  It balances compactness and simplicity,
   with reasonable representational power.  In the early days of the
   Arpanet, each specification contained its own definition of ABNF.
   This included the email specifications, RFC733 and then RFC822 which
   have come to be the common citations for defining ABNF.  The current
   document separates out that definition, to permit selective
   reference.  Predictably, it also provides some modifications and
   enhancements.
</t>
<t>
   The differences between standard BNF and ABNF involve naming rules,
   repetition, alternatives, order-independence, and value ranges.
   Appendix A (Core) supplies rule definitions and encoding for a core
   lexical analyzer of the type common to several Internet
   specifications.  It is provided as a convenience and is otherwise
   separate from the meta language defined in the body of this document,
   and separate from its formal status.
</t>
</section>

<section title="RULE DEFINITION">

<section title="Rule Naming">
<t>
   The name of a rule is simply the name itself; that is, a sequence of
   characters, beginning with  an alphabetic character, and followed by
   a combination of alphabetics, digits and hyphens (dashes).
</t>
<t>
  <list><t>
        NOTE:     Rule names are case-insensitive
  </t></list>
</t>
<t>
   The names &lt;rulename>, &lt;Rulename>, &lt;RULENAME> and &lt;rUlENamE> all refer
   to the same rule.
</t>
<t>
   Unlike original BNF, angle brackets ("&lt;", ">") are not  required.
   However, angle brackets may be used around a rule name whenever their
   presence will facilitate discerning the use of  a rule name.  This is
   typically restricted to rule name references in free-form prose, or
   to distinguish partial rules that combine into a string not separated
   by white space, such as shown in the discussion about repetition,
   below.
</t>
</section>

<section title="Rule Form">
<t>
   A rule is defined by the following sequence:
</t>
<figure><artwork>
        name =  elements crlf
</artwork></figure>
<t>
   where &lt;name> is the name of the rule, &lt;elements> is one or more rule
   names or terminal specifications and &lt;crlf> is the end-of-line
   indicator, carriage return followed by line feed.  The equal sign
   separates the name from the definition of the rule.  The elements
   form a sequence of one or more rule names and/or value definitions,
   combined according to the various operators, defined in this
   document, such as alternative and repetition.
</t>
<t>
   For visual ease, rule definitions are left aligned.  When a rule
   requires multiple lines, the continuation lines are indented.  The
   left alignment and indentation are relative to the first lines of the
   ABNF rules and need not match the left margin of the document.
</t>
</section>

<section title="Terminal Values">
<t>
   Rules resolve into a string of terminal values, sometimes called
   characters.  In ABNF a character is merely a non-negative integer.
   In certain contexts a specific mapping (encoding) of values into a
   character set (such as ASCII) will be specified.
</t>
<figure><preamble>
   Terminals are specified by one or more numeric characters with the
   base interpretation of those characters indicated explicitly.  The
   following bases are currently defined:
</preamble><artwork>
        b           =  binary

        d           =  decimal

        x           =  hexadecimal
</artwork></figure>
<figure><preamble>
   Hence:
</preamble><artwork>
        CR          =  %d13

        CR          =  %x0D
</artwork><postamble>
   respectively specify the decimal and hexadecimal representation of
   <xref target="US-ASCII"/> for carriage return.
</postamble></figure>
<figure><preamble>
   A concatenated string of such values is specified compactly, using a
   period (".") to indicate separation of characters within that value.
   Hence:
</preamble><artwork>
        CRLF        =  %d13.10
</artwork></figure>
<figure><preamble>
   ABNF permits specifying literal text string directly, enclosed in
   quotation-marks.  Hence:
</preamble><artwork>
        command     =  "command string"
</artwork></figure>
<t>
   Literal text strings are interpreted as a concatenated set of
   printable characters.
</t>
<t>
  <list><t>
        NOTE:     ABNF strings are case-insensitive and
                  the character set for these strings is us-ascii.
  </t></list>
</t>
<figure><preamble>
   Hence:
</preamble><artwork>
        rulename = "abc"
</artwork></figure>
<figure><preamble>
   and:
</preamble><artwork>
        rulename = "aBc"
</artwork><postamble>
   will match "abc", "Abc", "aBc", "abC", "ABc", "aBC", "AbC" and "ABC".
</postamble></figure>
<t>
  <list><t>
                To specify a rule which IS case SENSITIVE,
                   specify the characters individually.
  </t></list>
</t>
<figure><preamble>
   For example:
</preamble><artwork>
        rulename    =  %d97 %d98 %d99
</artwork></figure>
<figure><preamble>
   or
</preamble><artwork>
        rulename    =  %d97.98.99
</artwork><postamble>
   will match only the string which comprises only lowercased
   characters, abc.
</postamble></figure>
</section>

<section title="External Encodings">
<t>
   External representations of terminal value characters will vary
   according to constraints in the storage or transmission environment.
   Hence, the same ABNF-based grammar may have multiple external
   encodings, such as one for a 7-bit US-ASCII environment, another for
   a binary octet environment and still a different one when 16-bit
   Unicode is used.  Encoding details are beyond the scope of ABNF,
   although Appendix A (Core) provides definitions for a 7-bit US-ASCII
   environment as has been common to much of the Internet.
</t>
<t>
   By separating external encoding from the syntax, it is intended that
   alternate encoding environments can be used for the same syntax.
</t>
</section>
</section>

<section title="OPERATORS">

<section title="Concatenation    Rule1     Rule2">
<t>
   A rule can define a simple, ordered string of values -- i.e., a
   concatenation of contiguous characters -- by listing a sequence of
   rule names.  For example:
</t>
<figure><artwork>
        foo         =  %x61           ; a

        bar         =  %x62           ; b

        mumble      =  foo bar foo
</artwork></figure>
<t>
  <list>
        <t>So that the rule &lt;mumble> matches the lowercase string "aba".</t>

        <t>LINEAR WHITE SPACE:  Concatenation is at the core of the ABNF
        parsing model.  A string of contiguous characters (values) is
        parsed according to the rules defined in ABNF.  For Internet
        specifications, there is some history of permitting linear white
        space (space and horizontal tab) to be freelyPand
        implicitlyPinterspersed around major constructs, such as
        delimiting special characters or atomic strings.</t>

        <t>NOTE:     This specification for ABNF does not
                  provide for implicit specification of linear white
                  space.</t>
  </list>
</t>
<t>
   Any grammar which wishes to permit linear white space around
   delimiters or string segments must specify it explicitly.  It is
   often useful to provide for such white space in "core" rules that are
   then used variously among higher-level rules.  The "core" rules might
   be formed into a lexical analyzer or simply be part of the main
   ruleset.
</t>
</section>

<section title="Alternatives                               Rule1 / Rule2">
<t>
   Elements separated by forward slash ("/") are alternatives.
   Therefore,
</t>
<figure><artwork>
        foo / bar
</artwork><postamble>
   will accept &lt;foo> or &lt;bar>.
</postamble></figure>
<t>
  <list><t>
                  NOTE: A quoted string containing alphabetic
                  characters is special form for specifying alternative
                  characters and is interpreted as a non-terminal
                  representing the set of combinatorial strings with the
                  contained characters, in the specified order but with
                  any mixture of upper and lower case..
    </t>
  </list>
</t>
</section>

<section title="Incremental Alternatives                    Rule1 =/ Rule2">
<t>
   It is sometimes convenient to specify a list of alternatives in
   fragments.  That is, an initial rule may match one or more
   alternatives, with later rule definitions adding to the set of
   alternatives.  This is particularly useful for otherwise-independent
   specifications which derive from the same parent rule set, such as
   often occurs with parameter lists.  ABNF permits this incremental
   definition through the construct:
</t>
<figure><artwork>
        oldrule     =/ additional-alternatives
</artwork></figure>
<figure><preamble>
   So that the rule set
</preamble><artwork>
        ruleset     =  alt1 / alt2

        ruleset     =/ alt3

        ruleset     =/ alt4 / alt5
</artwork></figure>
<figure><preamble>
   is the same as specifying
</preamble><artwork>
        ruleset     =  alt1 / alt2 / alt3 / alt4 / alt5
</artwork></figure>        
</section>

<section title="Value Range Alternatives                           %c##-##">
<figure><preamble>
   A range of alternative numeric values can be specified compactly,
   using dash ("-") to indicate the range of alternative values.  Hence:
</preamble><artwork>
        DIGIT       =  %x30-39
</artwork></figure>
<figure><preamble>
   is equivalent to:
</preamble><artwork>
        DIGIT       =  "0" / "1" / "2" / "3" / "4" / "5" / "6" /

                           "7" / "8" / "9"
</artwork></figure>
<figure><preamble>
   Concatenated numeric values and numeric value ranges can not be
   specified in the same string.  A numeric value may use the dotted
   notation for concatenation or it may use the dash notation to specify
   one value range.  Hence, to specify one printable character, between
   end of line sequences, the specification could be:
</preamble><artwork>
        char-line = %x0D.0A %x20-7E %x0D.0A
</artwork></figure>
</section>

<section title="Sequence Group                             (Rule1 Rule2)">
<figure><preamble>
   Elements enclosed in parentheses are treated as a single element,
   whose contents are STRICTLY ORDERED.   Thus,
</preamble><artwork>
        elem (foo / bar) blat
</artwork><postamble>
   which matches (elem foo blat) or (elem bar blat).
</postamble></figure>
<figure><artwork>
        elem foo / bar blat
</artwork><postamble>
   matches (elem foo) or (bar blat).
</postamble></figure>
<t>
  <list><t>
        NOTE:     It is strongly advised to use grouping
                  notation, rather than to rely on proper reading of
                  "bare" alternations, when alternatives consist of
                  multiple rule names or literals.
  </t></list>
</t>
<figure><preamble>
   Hence it is recommended that instead of the above form, the form:
</preamble><artwork>
        (elem foo) / (bar blat)
</artwork><postamble>
   be used.  It will avoid misinterpretation by casual readers.
</postamble></figure>
<t>
   The sequence group notation is also used within free text to set off
   an element sequence from the prose.
</t>
</section>

<section title="Variable Repetition                                *Rule">
<figure><preamble>
   The operator "*" preceding an element indicates repetition. The full
   form is:
</preamble><artwork>
        &lt;a>*&lt;b>element
</artwork><postamble>
   where &lt;a> and &lt;b> are optional decimal values, indicating at least
   &lt;a> and at most &lt;b> occurrences of element.
</postamble></figure>
<t>
   Default values are 0 and infinity so that *&lt;element> allows any
   number, including zero; 1*&lt;element> requires at  least  one;
   3*3&lt;element> allows exactly 3 and 1*2&lt;element> allows one or two.
</t>
</section>

<section title="Specific Repetition                                  nRule">
<figure><preamble>
   A rule of the form:
</preamble><artwork>
        &lt;n>element
</artwork></figure>
<figure><preamble>
   is equivalent to
</preamble><artwork>
        &lt;n>*&lt;n>element
</artwork></figure>
<t>
   That is, exactly  &lt;N>  occurrences  of &lt;element>. Thus 2DIGIT is a
   2-digit number, and 3ALPHA is a string of three alphabetic
   characters.
</t>
</section>

<section title="Optional Sequence                                   [RULE]">
<figure><preamble>
   Square brackets enclose an optional element sequence:
</preamble><artwork>
        [foo bar]
</artwork></figure>
<figure><preamble>
   is equivalent to
</preamble><artwork>
        *1(foo bar).
</artwork></figure>
</section>

<section title="; Comment">
<t>
   A semi-colon starts a comment that continues to the end of line.
   This is a simple way of including useful notes in parallel with the
   specifications.
</t>
</section>

<section title="Operator Precedence">
<t>
   The various mechanisms described above have the following precedence,
   from highest (binding tightest) at the top, to lowest and loosest at
   the bottom:
  <list>
        <t>Strings, Names formation</t>
        <t>Comment</t>
        <t>Value range</t>
        <t>Repetition</t>
        <t>Grouping, Optional</t>
        <t>Concatenation</t>
        <t>Alternative</t>
  </list>
</t>
<t>
   Use of the alternative operator, freely mixed with concatenations can
   be confusing.
</t>
<t>
  <list><t>
        Again, it is recommended that the grouping operator be used to
        make explicit concatenation groups.
  </t></list>
</t>
</section>


</section>

<section title="ABNF DEFINITION OF ABNF">
<t>
   This syntax uses the rules provided in <xref target="core"/> (Core).
</t>
<figure><artwork>
        rulelist       =  1*( rule / (*c-wsp c-nl) )

        rule           =  rulename defined-as elements c-nl
                               ; continues if next line starts
                               ;  with white space

        rulename       =  ALPHA *(ALPHA / DIGIT / "-")

        defined-as     =  *c-wsp ("=" / "=/") *c-wsp
                               ; basic rules definition and
                               ;  incremental alternatives

        elements       =  alternation *c-wsp

        c-wsp          =  WSP / (c-nl WSP)

        c-nl           =  comment / CRLF
                               ; comment or newline

        comment        =  ";" *(WSP / VCHAR) CRLF

        alternation    =  concatenation
                          *(*c-wsp "/" *c-wsp concatenation)

        concatenation  =  repetition *(1*c-wsp repetition)

        repetition     =  [repeat] element

        repeat         =  1*DIGIT / (*DIGIT "*" *DIGIT)

        element        =  rulename / group / option /
                          char-val / num-val / prose-val

        group          =  "(" *c-wsp alternation *c-wsp ")"

        option         =  "[" *c-wsp alternation *c-wsp "]"

        char-val       =  DQUOTE *(%x20-21 / %x23-7E) DQUOTE
                               ; quoted string of SP and VCHAR
                                  without DQUOTE

        num-val        =  "%" (bin-val / dec-val / hex-val)

        bin-val        =  "b" 1*BIT
                          [ 1*("." 1*BIT) / ("-" 1*BIT) ]
                               ; series of concatenated bit values
                               ; or single ONEOF range

        dec-val        =  "d" 1*DIGIT
                          [ 1*("." 1*DIGIT) / ("-" 1*DIGIT) ]

        hex-val        =  "x" 1*HEXDIG
                          [ 1*("." 1*HEXDIG) / ("-" 1*HEXDIG) ]

        prose-val      =  "&lt;" *(%x20-3D / %x3F-7E) ">"
                               ; bracketed string of SP and VCHAR
                                  without angles
                               ; prose description, to be used as
                                  last resort
</artwork></figure>
</section>

<section title="SECURITY CONSIDERATIONS">
<t>
  Security is truly believed to be irrelevant to this document.
</t>
</section>


<section title="APPENDIX A - CORE" anchor="core">
<t>
   This Appendix is provided as a convenient core for specific grammars.
   The definitions may be used as a core set of rules.
</t>

<section title="Core Rules">
<t>
   Certain  basic  rules  are  in uppercase, such as SP, HTAB, CRLF,
   DIGIT, ALPHA, etc.
</t>
<figure><artwork>
        ALPHA          =  %x41-5A / %x61-7A   ; A-Z / a-z

        BIT            =  "0" / "1"

        CHAR           =  %x01-7F
                               ; any 7-bit US-ASCII character,
                                  excluding NUL

        CR             =  %x0D
                               ; carriage return

        CRLF           =  CR LF
                               ; Internet standard newline

        CTL            =  %x00-1F / %x7F
                               ; controls

        DIGIT          =  %x30-39
                               ; 0-9

        DQUOTE         =  %x22
                               ; " (Double Quote)

        HEXDIG         =  DIGIT / "A" / "B" / "C" / "D" / "E" / "F"

        HTAB           =  %x09
                               ; horizontal tab

        LF             =  %x0A
                               ; linefeed

        LWSP           =  *(WSP / CRLF WSP)
                               ; linear white space (past newline)

        OCTET          =  %x00-FF
                               ; 8 bits of data

        SP             =  %x20

        VCHAR          =  %x21-7E
                               ; visible (printing) characters

        WSP            =  SP / HTAB
                               ; white space
</artwork></figure>
</section>

<section title="Common Encoding">
<t>
   Externally, data are represented as "network virtual ASCII", namely
   7-bit US-ASCII in an 8-bit field, with the high (8th) bit set to
   zero.  A string of values is in "network byte order" with the
   higher-valued bytes represented on the left-hand side and being sent
   over the network first.
</t>
</section>

</section>

<section title="ACKNOWLEDGEMENTS">
<t>
   The syntax for ABNF was originally specified in RFC 733.  Ken L.
   Harrenstien, of SRI International, was responsible for re-coding the
   BNF into an augmented BNF that makes the representation smaller and
   easier to understand.
</t>
<t>
   This recent project began as a simple effort to cull out the portion
   of RFC 822 which has been repeatedly cited by non-email specification
   writers, namely the description of augmented BNF.  Rather than simply
   and blindly converting the existing text into a separate document,
   the working group chose to give careful consideration to the
   deficiencies, as well as benefits, of the existing specification and
   related specifications available over the last 15 years and therefore
   to pursue enhancement.  This turned the project into something rather
   more ambitious than first intended.  Interestingly the result is not
   massively different from that original, although decisions such as
   removing the list notation came as a surprise.
</t>
<t>
   The current round of specification was part of the DRUMS working
   group, with significant contributions from Jerome Abela , Harald
   Alvestrand, Robert Elz, Roger Fajman, Aviva Garrett, Tom Harsch, Dan
   Kohn, Bill McQuillan, Keith Moore, Chris Newman , Pete Resnick and
   Henning Schulzrinne.
</t>
</section>

</middle>
  
<back>
<references>
<reference anchor="US-ASCII">
  <front>
    <title>Coded Character Set -- 7-bit American Standard Code for Information Interchange</title>
    <author>
      <organization>American National Standards Institute</organization>
    </author>
    <date year="1986" />
  </front>
  <seriesInfo name="ANSI" value="X3.4" />
</reference>

<reference anchor='RFC733'>

<front>
<title>Standard for the format of ARPA network text messages</title>
<author initials='D.' surname='Crocker' fullname='David H. Crocker'>
<organization>The Rand Corporation, Information Sciences Department</organization>
<address>
<postal>
<street>1700 Main St</street>
<city>Santa Monica</city>
<region>CA</region>

<code>90406</code>
<country>US</country></postal>
<email>DCrocker@Rand-Unix</email></address></author>
<author initials='J.' surname='Vittal' fullname='John J. Vittal'>
<organization>Bolt Beranek and Newman Inc. (BBN)</organization>
<address>
<postal>
<street>50 Moulton St.</street>
<city>Cambridge</city>
<region>MA</region>

<code>02138</code>
<country>US</country></postal>
<email>Vittal@BBN-TenexD</email></address></author>
<author initials='K.' surname='Pogran' fullname='Kenneth T. Pogran'>
<organization>Massachusets Institute of Technology (MIT), Laboratory for Computer Science</organization>
<address>
<postal>
<street>545 Technology Square</street>
<city>Cambridge</city>
<region>MA</region>

<code>02139</code>
<country>US</country></postal>
<email>Pogran@MIT-Multics</email></address></author>
<author initials='D.' surname='Henderson' fullname='D. Austin Henderson, Jr.'>
<organization>Bolt Beranek and Newman Inc. (BBN)</organization>
<address>
<postal>
<street>50 Moulton St.</street>
<city>Cambridge</city>
<region>MA</region>

<code>02138</code>
<country>US</country></postal>
<email>Henderson@BBN-TenexD</email></address></author>
<date year='1977' day='21' month='November' /></front>

<seriesInfo name='RFC' value='733' />
</reference>

<reference anchor='RFC822'>

<front>
<title abbrev='Standard for ARPA Internet Text Messages'>Standard for the format of ARPA Internet text messages</title>
<author initials='D.H.' surname='Crocker' fullname='David H. Crocker'>
<organization>University of Delaware, Dept. of Electrical Engineering</organization>
<address>
<postal>
<street />
<city>Newark</city>
<region>DE</region>

<code>19711</code>
<country>US</country></postal>
<email>DCrocker@UDel-Relay</email></address></author>
<date year='1982' day='13' month='August' /></front>

<seriesInfo name='STD' value='11' />
<seriesInfo name='RFC' value='822' />
</reference>

</references>

</back>

</rfc>