<?xml version="1.0"?>
<?xml-stylesheet type="text/css" href="http://eplmediawiki.di.uminho.pt/skins/common/feed.css?303"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://eplmediawiki.di.uminho.pt/index.php?action=history&amp;feed=atom&amp;title=Translation_Grammar</id>
		<title>Translation Grammar - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://eplmediawiki.di.uminho.pt/index.php?action=history&amp;feed=atom&amp;title=Translation_Grammar"/>
		<link rel="alternate" type="text/html" href="http://eplmediawiki.di.uminho.pt/index.php?title=Translation_Grammar&amp;action=history"/>
		<updated>2026-08-13T21:13:11Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.20.0</generator>

	<entry>
		<id>http://eplmediawiki.di.uminho.pt/index.php?title=Translation_Grammar&amp;diff=250&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;A translation grammar is an ordered sixtuple ''TG'' = ''(T, N, SA, S, P, R)'' , where ''N'' and ''T'' are finite alphabets, ''SA'' is a finite set of semantic actions, ''S'' i...&quot;</title>
		<link rel="alternate" type="text/html" href="http://eplmediawiki.di.uminho.pt/index.php?title=Translation_Grammar&amp;diff=250&amp;oldid=prev"/>
				<updated>2012-11-24T19:25:58Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;A translation grammar is an ordered sixtuple &amp;#039;&amp;#039;TG&amp;#039;&amp;#039; = &amp;#039;&amp;#039;(T, N, SA, S, P, R)&amp;#039;&amp;#039; , where &amp;#039;&amp;#039;N&amp;#039;&amp;#039; and &amp;#039;&amp;#039;T&amp;#039;&amp;#039; are finite alphabets, &amp;#039;&amp;#039;SA&amp;#039;&amp;#039; is a finite set of semantic actions, &amp;#039;&amp;#039;S&amp;#039;&amp;#039; i...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;A translation grammar is an ordered sixtuple ''TG'' = ''(T, N, SA, S, P, R)'' , where ''N'' and ''T'' are finite alphabets, ''SA'' is a finite set of semantic actions, ''S'' is a distinguished symbol of ''N'', ''P'' is a finite non-empty set pairs (''L,R'') such that ''L'' and ''R'' are in (''N U T'')* and ''R'' is a set of pairs (''p,a'') where ''p'' is in ''P'' and ''a'' is in ''SA''.&lt;br /&gt;
&lt;br /&gt;
[[Category:Basic Concepts]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>	</entry>

	</feed>