Collected Extensions to IMAP4 ABNF

Melnikov, Alexey; Daboo, Cyrus

doi:10.17487/rfc4466

Cited by 17 publications

(12 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This extension defines the "USE" parameter to the IMAP CREATE command for that purpose (using the syntax defined in RFC 4466 section 2.2 [RFC4466]). The new OPTIONAL "USE" parameter is followed by a parenthesized list of zero or more special-use attributes, as defined above.…”

Section: Extension To Imap Create Command To Set Special-use Attributesmentioning

confidence: 99%

IMAP LIST Extension for Special-Use Mailboxes

Leiba¹,

Nicolson²

2011

View full text Add to dashboard Cite

Some IMAP message stores include special-use mailboxes, such as those used to hold draft messages or sent messages. Many mail clients allow users to specify where draft or sent messages should be put, but configuring them requires that the user know which mailboxes the server has set aside for these purposes. This extension adds new optional mailbox attributes that a server may include in IMAP LIST command responses to identify special-use mailboxes to the client, easing configuration.

show abstract

Section: Extension To Imap Create Command To Set Special-use Attributesmentioning

confidence: 99%

IMAP LIST Extension for Special-Use Mailboxes

Leiba¹,

Nicolson²

2011

View full text Add to dashboard Cite

show abstract

“…For example, protocols that need to transfer binary data often do so using messages consisting of the length of the data followed by the data. In the IMAP mail protocol [4] these are called literals, and their syntax is specified in the RFC [25] as follows: Here number is an ASCII representation of the length of the data, CRLF is a carriage return and linefeed, and OCTET is any 8-bit value. We can express the syntax of an IMAP literal directly using bindings and constraints:…”

Section: Yakker By Examplementioning

confidence: 99%

Semantics and algorithms for data-dependent grammars

Jim

Mandelbaum

Walker

2010

Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YAKKER, capable of handling the requirements of modern applications including (1) full scannerless context-free grammars with (2) regular expressions as right-hand sides for defining nonterminals. YAKKER also includes (3) facilities for binding variables to intermediate parse results and (4) using such bindings within arbitrary constraints to control parsing. These facilities allow the kind of data-dependent parsing commonly needed in systems applications, particularly those that operate over binary data. In addition, (5) nonterminals may be parameterized by arbitrary values, which gives the system good modularity and abstraction properties in the presence of data-dependent parsing. Finally, (6) legacy parsing libraries, such as sophisticated libraries for dates and times, may be directly incorporated into parser specifications. We illustrate the importance and utility of this rich format specification language by presenting its use on examples ranging from difficult programming language grammars to web server logs to binary data specification. We also show that our grammars have important compositionality properties and explain why such properties are important in modern applications such as automatic grammar induction.In terms of technical contributions, we provide a traditional high-level semantics for our new grammar formalization and show how to compile these grammars into nondeterministic automata. These automata are stack-based, somewhat like conventional pushdown automata, but are also equipped with environments to track data-dependent parsing state. We prove the correctness of our translation of data-dependent grammars into these new automata and then show how to implement the automata efficiently using a variation of Earley's parsing algorithm.

show abstract

“…In addition, rules from IMAP4rev1 [RFC3501], UTF-8 [RFC3629], "Collected Extensions to IMAP4 ABNF" [RFC4466], and IMAP4 LIST Command Extensions [RFC5258] are also referenced.…”

Section: Conventions Used In This Documentmentioning

confidence: 99%