loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th Annual Symposium on Switching and Automata Theory (SWAT 1970)
Parsing algorithms with backtrack
October 28-October 30
ASCII Text
x 
 
Alexander Birman, Jeffrey D. Ullman, "Parsing algorithms with backtrack," Foundations of Computer Science, IEEE Annual Symposium on, pp. 153-174, 11th Annual Symposium on Switching and Automata Theory (SWAT 1970), 1970.
 
 
BibTex
x
 
@article{ 10.1109/SWAT.1970.18,
author = {Alexander Birman and Jeffrey D. Ullman},
title = {Parsing algorithms with backtrack},
journal ={Foundations of Computer Science, IEEE Annual Symposium on},
volume = {0},
year = {1970},
issn = {0272-4847},
pages = {153-174},
doi = {http://doi.ieeecomputersociety.org/10.1109/SWAT.1970.18},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Foundations of Computer Science, IEEE Annual Symposium on
TI - Parsing algorithms with backtrack
SN - 0272-4847
SP153
EP174
A1 - Alexander Birman,
A1 - Jeffrey D. Ullman,
PY - 1970
VL - 0
JA - Foundations of Computer Science, IEEE Annual Symposium on
ER -
 
Two classes of restricted top down parsing algorithms using backtrack are considered. We show that the smaller class recognizes all deterministic context free languages, and that both classes can be simulated in linear time on a random access machine. Certain generalizations of these parsing algorithms are shown equivalent to the larger class. Finally, some decision and closure properties of the classes of languages defined are given.
Citation:
Alexander Birman, Jeffrey D. Ullman, "Parsing algorithms with backtrack," focs, pp.153-174, 11th Annual Symposium on Switching and Automata Theory (SWAT 1970), 1970
Usage of this product signifies your acceptance of the Terms of Use.