<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM19Yallop</id>
	<title>WG211/M19Yallop - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM19Yallop"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M19Yallop&amp;action=history"/>
	<updated>2026-04-05T20:58:40Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M19Yallop&amp;diff=2036&amp;oldid=prev</id>
		<title>Ups: Created page with &quot;&#039;&#039;A typed, algebraic approach to parsing&#039;&#039; by Jeremy Yallop, joint work with Neel Krishnaswami  Context-free expressions are an algebraic presentation of context-free language...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M19Yallop&amp;diff=2036&amp;oldid=prev"/>
		<updated>2019-04-29T01:03:37Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;A typed, algebraic approach to parsing&amp;#039;&amp;#039; by Jeremy Yallop, joint work with Neel Krishnaswami  Context-free expressions are an algebraic presentation of context-free language...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;A typed, algebraic approach to parsing&amp;#039;&amp;#039; by Jeremy Yallop, joint work with Neel Krishnaswami&lt;br /&gt;
&lt;br /&gt;
Context-free expressions are an algebraic presentation of&lt;br /&gt;
context-free languages. We define a core type system for context-free&lt;br /&gt;
expressions that identifies those expressions which can be parsed&lt;br /&gt;
unambiguously by recursive descent or LL(1).&lt;br /&gt;
&lt;br /&gt;
We next use these typed grammar expressions to build parser&lt;br /&gt;
combinators that guarantee linear-time parsing without backtracking&lt;br /&gt;
and with single-token lookahead, and that respect the natural&lt;br /&gt;
denotational semantics.&lt;br /&gt;
&lt;br /&gt;
Finally, we exploit the type information to stage the combinators,&lt;br /&gt;
yielding dramatic increases in performance, even outperforming code&lt;br /&gt;
generated by (ocaml)yacc.&lt;/div&gt;</summary>
		<author><name>Ups</name></author>
	</entry>
</feed>