<--- Back to Details
First PageDocument Content
Programming language implementation / Software engineering / Parsing / XML / LL parser / LR parser / Document Type Definition / Context-free grammar / Deterministic context-free grammar / Formal languages / Computing / Compiler construction
Date: 2013-04-23 05:41:26
Programming language implementation
Software engineering
Parsing
XML
LL parser
LR parser
Document Type Definition
Context-free grammar
Deterministic context-free grammar
Formal languages
Computing
Compiler construction

Foundations of Fast Communication via XML Welf Löwe, Markus L. Noga, Thilo S. Gaul Institut für Programmstrukturen und Datenorganisation, Universität Karlsruhe Postfach 6980, 76128 Karlsruhe, Germany E-mail: {loewe |

Add to Reading List

Source URL: welf.se

Download Document from Source Website

File Size: 291,92 KB

Share Document on Facebook

Similar Documents

On the Visualization of Context-Free Grammar Ike Antkare International Institute of Technology United Slates of Earth

On the Visualization of Context-Free Grammar Ike Antkare International Institute of Technology United Slates of Earth

DocID: 1srZB - View Document

American Control Conference, JuneThe Motion Grammar Calculus for Context-Free Hybrid Systems Neil Dantam  Mike Stilman

American Control Conference, JuneThe Motion Grammar Calculus for Context-Free Hybrid Systems Neil Dantam Mike Stilman

DocID: 1s0XJ - View Document

Synthesizing Context-Free Grammar Using Probabilistic Epistemologies Ike Antkare International Institute of Technology United Slates of Earth

Synthesizing Context-Free Grammar Using Probabilistic Epistemologies Ike Antkare International Institute of Technology United Slates of Earth

DocID: 1s0Vh - View Document

24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)

24. Theorietag „Automaten und Formale Sprachen“ Caputh, 23. – 25. September 2014 Henning Bordihn, Bianca Truthe (Hrsg.)

DocID: 1rsDZ - View Document

m-multiple context-free grammars  The Pumping Lemma for Well-Nested Multiple Context-Free Languages

m-multiple context-free grammars The Pumping Lemma for Well-Nested Multiple Context-Free Languages

DocID: 1rqE5 - View Document