| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Grammars And Other Rewriting Systems (F.4.2) > Parsing (F.4.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 18
Reviews about "Parsing (F.4.2...)":
|
Date Reviewed |
| |
Parsing techniques (Monographs in Computer Science)
Grune D., Jacobs C., Springer-Verlag New York, Inc., Secaucus, NJ, 2006. 662 pp. Type: Book (9780387202488)
Historically speaking, parsing techniques are considered an old topic in computer science (CS), and many good books exist on the subject. What makes this book different is its well-balanced material that includes not only explanatory d...
|
May 30 2008 |
| |
Probabilistic parsing strategies
Nederhof M., Satta G. Journal of the ACM 53(3): 406-436, 2006. Type: Article
Probabilistic parsing is an area of natural language processing that has attracted considerable attention from researchers in the last decade. This growing interest has been fostered by widespread availability of corpora (or treebanks)...
|
May 29 2007 |
| |
Linear time parsers for classes of non context free languages
Kulkarni S., Shankar P. Theoretical Computer Science 165(2): 355-390, 1996. Type: Article
The authors describe deterministic parsers for languages defined by two-level grammars: a first context-free grammar G1 simultaneously generates strings S of the target language and control words W...
|
Dec 1 1997 |
| |
Controlled grammatic ambiguity
Thorup M. ACM Transactions on Programming Languages and Systems 16(3): 1024-1050, 1994. Type: Article
The ambiguous grammars have long been considered relevant in connection with programming languages because they are often simpler and more natural than their unambiguous counterparts. Moreover, they can often be parsed more efficiently...
|
Jul 1 1995 |
| |
Recognizing substrings of LR(k) languages in linear time
Bates J., Lavie A. ACM Transactions on Programming Languages and Systems 16(3): 1051-1077, 1994. Type: Article
The problem of recognizing the substrings of LR(k) languages is addressed. A detailed description of the algorithm in the case of one lookahead symbol is given in the second section. An interesting data structure, called a forest-struc...
|
Jul 1 1995 |
| |
A “yo-yo” parsing algorithm for a large class of van Wijngaarden grammars
Fisher A. Acta Informatica 29(5): 461-481, 1992. Type: Article
The van Wijngaarden grammars (VWG) are grammars for describing languages that are not context-free. The applicability of those grammars is limited, however, because, in order to be practically useful, grammars have to be strongly restr...
|
Aug 1 1993 |
| |
Parsing techniques
Grune D., Jacobs C., Ellis Horwood, Upper Saddle River, NJ, 1990. Type: Book (9780136514312)
The tremendous development of computer applications in many fields has led to the creation of new languages that are well-suited for specific domains. Running a program written in a new language on a specific computer requires a compil...
|
Feb 1 1993 |
| |
Table compression for tree automata
Börstler J., Möncke U., Wilhelm R. ACM Transactions on Programming Languages and Systems 13(3): 295-314, 1991. Type: Article
The OPTRAN system is a tool for generating programs that transform attributed trees. It is useful for generating source-to-source translators and parts of compilers. OPTRAN uses finite-state bottom-up tree automata in the generated pro...
|
Feb 1 1993 |
| |
Efficient construction of LR(k) states and tables
Anicona M., Dodero G., Gianuzzi V., Morgavi M. ACM Transactions on Programming Languages and Systems 13(1): 150-178, 1991. Type: Article
The authors present a new method for building LR(k) parsing tables, called reduced tables, and the associated reduced parser (a shift-reduce parsing algorithm) driven by these tables. The reduced tables are obtained from the set...
|
Mar 1 1992 |
| |
Parsing theory volume 2: LR(K) and LL(K) parsing
Sippu S., Soisalon-Soininen E., Springer-Verlag New York, Inc., New York, NY, 1990. Type: Book (9780387517322)
The second half of a 650-page monograph on the theory of parsing, this volume covers the theory, mathematics, construction, use, and practice of parsers built using LR(k) and LL(k) techniques. It assumes knowledge of the material in vo...
|
Oct 1 1991 |
| |
|
|
| |
|
|
