메뉴 건너뛰기




Volumn 203, Issue 2, 2008, Pages 69-84

An Experimental Ambiguity Detection Tool

Author keywords

disambiguation; GLR; grammar verification

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LANGUAGES; SET THEORY;

EID: 41349104272     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.03.045     Document Type: Article
Times cited : (5)

References (34)
  • 1
    • 0016543997 scopus 로고
    • Deterministic parsing of ambiguous grammars
    • 10.1145/360933.360969
    • Aho A.V., Johnson S.C., and Ullman J.D. Deterministic parsing of ambiguous grammars. Communications of the ACM 18 (1975) 441-452 10.1145/360933.360969
    • (1975) Communications of the ACM , vol.18 , pp. 441-452
    • Aho, A.V.1    Johnson, S.C.2    Ullman, J.D.3
  • 2
    • 0003791899 scopus 로고
    • The Theory of Parsing, Translation, and Compiling. Volume I: Parsing
    • Prentice Hall
    • Aho A.V., and Ullman J.D. The Theory of Parsing, Translation, and Compiling. Volume I: Parsing. Series in Automatic Computation (1972), Prentice Hall
    • (1972) Series in Automatic Computation
    • Aho, A.V.1    Ullman, J.D.2
  • 3
    • 0025499099 scopus 로고
    • Practical arbitrary lookahead LR parsing
    • 10.1016/0022-0000(90)90037-L
    • Bermudez M.E., and Schimpf K.M. Practical arbitrary lookahead LR parsing. Journal of Computer and System Sciences 41 (1990) 230-250 10.1016/0022-0000(90)90037-L
    • (1990) Journal of Computer and System Sciences , vol.41 , pp. 230-250
    • Bermudez, M.E.1    Schimpf, K.M.2
  • 4
    • 41349122343 scopus 로고    scopus 로고
    • Billot, S. and B. Lang, The structure of shared forests in ambiguous parsing, in: ACL'89 (1989), pp. 143-151. URL http://www.aclweb.org/anthology/P89-1018
    • Billot, S. and B. Lang, The structure of shared forests in ambiguous parsing, in: ACL'89 (1989), pp. 143-151. URL http://www.aclweb.org/anthology/P89-1018
  • 5
    • 38149029316 scopus 로고    scopus 로고
    • Brabrand, C., R. Giegerich and A. Møller, Analyzing ambiguity of context-free grammars, in: M. Balík and J. Holub, editors, CIAA'07, 2007, to appear in Lecture Notes in Computer Science. URL http://www.brics.dk/~brabrand/grambiguity/
    • Brabrand, C., R. Giegerich and A. Møller, Analyzing ambiguity of context-free grammars, in: M. Balík and J. Holub, editors, CIAA'07, 2007, to appear in Lecture Notes in Computer Science. URL http://www.brics.dk/~brabrand/grambiguity/
  • 6
    • 38149032055 scopus 로고
    • On the ambiguity problem of Backus systems
    • 10.1145/321138.321145
    • Cantor D.G. On the ambiguity problem of Backus systems. Journal of the ACM 9 (1962) 477-479 10.1145/321138.321145
    • (1962) Journal of the ACM , vol.9 , pp. 477-479
    • Cantor, D.G.1
  • 7
    • 0000226662 scopus 로고
    • Graphes canoniques de graphes algébriques
    • URL
    • Caucal D. Graphes canoniques de graphes algébriques. RAIRO - Theoretical Informatics and Applications 24 (1990) 339-352. http://www.inria.fr/rrrt/rr-0872.html URL
    • (1990) RAIRO - Theoretical Informatics and Applications , vol.24 , pp. 339-352
    • Caucal, D.1
  • 8
    • 77956972992 scopus 로고
    • The algebraic theory of context-free languages
    • Computer Programming and Formal Systems. Braffort P., and Hirshberg D. (Eds), North-Holland Publishing
    • Chomsky N., and Schützenberger M.P. The algebraic theory of context-free languages. In: Braffort P., and Hirshberg D. (Eds). Computer Programming and Formal Systems. Studies in Logic (1963), North-Holland Publishing 118-161
    • (1963) Studies in Logic , pp. 118-161
    • Chomsky, N.1    Schützenberger, M.P.2
  • 11
    • 0014732304 scopus 로고
    • An efficient context-free parsing algorithm
    • 10.1145/362007.362035
    • Earley J. An efficient context-free parsing algorithm. Communications of the ACM 13 (1970) 94-102 10.1145/362007.362035
    • (1970) Communications of the ACM , vol.13 , pp. 94-102
    • Earley, J.1
  • 12
    • 33749392352 scopus 로고    scopus 로고
    • Shift-resolve parsing: Simple, linear time, unbounded lookahead
    • CIAA'06. Ibarra O.H., and Yen H.-C. (Eds) 10.1007/11812128_24
    • Fortes Gálvez J., Schmitz S., and Farré J. Shift-resolve parsing: Simple, linear time, unbounded lookahead. In: Ibarra O.H., and Yen H.-C. (Eds). CIAA'06. Lecture Notes in Computer Science 4094 (2006) 253-264 10.1007/11812128_24
    • (2006) Lecture Notes in Computer Science , vol.4094 , pp. 253-264
    • Fortes Gálvez, J.1    Schmitz, S.2    Farré, J.3
  • 14
    • 41349119506 scopus 로고    scopus 로고
    • Hunt III, H.B., T.G. Szymanski and J.D. Ullman, Operations on sparse relations and efficient algorithms for grammar problems, in: 15th Annual Symposium on Switching and Automata Theory (1974), pp. 127-132
    • Hunt III, H.B., T.G. Szymanski and J.D. Ullman, Operations on sparse relations and efficient algorithms for grammar problems, in: 15th Annual Symposium on Switching and Automata Theory (1974), pp. 127-132
  • 15
    • 41349114969 scopus 로고    scopus 로고
    • Johnson, S.C., YACC - yet another compiler compiler, Computing science technical report 32, AT&T Bell Laboratories, Murray Hill, New Jersey (1975)
    • Johnson, S.C., YACC - yet another compiler compiler, Computing science technical report 32, AT&T Bell Laboratories, Murray Hill, New Jersey (1975)
  • 16
    • 41349092431 scopus 로고    scopus 로고
    • Kahrs, S., Mistakes and ambiguities in the definition of Standard ML, Technical Report ECS-LFCS-93-257, University of Edinburgh, LFCS (1993). URL http://www.lfcs.inf.ed.ac.uk/reports/93/ECS-LFCS-93-257/
    • Kahrs, S., Mistakes and ambiguities in the definition of Standard ML, Technical Report ECS-LFCS-93-257, University of Edinburgh, LFCS (1993). URL http://www.lfcs.inf.ed.ac.uk/reports/93/ECS-LFCS-93-257/
  • 19
    • 41349085097 scopus 로고    scopus 로고
    • Klint, P. and E. Visser, Using filters for the disambiguation of context-free grammars, in: G. Pighizzini and P. San Pietro, editors, ASMICS Workshop on Parsing Theory, Technical Report 126-1994 (1994), pp. 89-100. URL http://citeseer.ist.psu.edu/klint94using.html
    • Klint, P. and E. Visser, Using filters for the disambiguation of context-free grammars, in: G. Pighizzini and P. San Pietro, editors, ASMICS Workshop on Parsing Theory, Technical Report 126-1994 (1994), pp. 89-100. URL http://citeseer.ist.psu.edu/klint94using.html
  • 20
    • 0035657638 scopus 로고    scopus 로고
    • Semi-automatic grammar recovery
    • 10.1002/spe.423
    • Lämmel R., and Verhoef C. Semi-automatic grammar recovery. Software: Practice & Experience 31 (2001) 1395-1438 10.1002/spe.423
    • (2001) Software: Practice & Experience , vol.31 , pp. 1395-1438
    • Lämmel, R.1    Verhoef, C.2
  • 21
    • 41349123626 scopus 로고    scopus 로고
    • Carnegie Mellon University URL
    • Lee P. Using the SML/NJ System (1997), Carnegie Mellon University. http://www.cs.cmu.edu/~petel/smlguide/smlnj.htm URL
    • (1997) Using the SML/NJ System
    • Lee, P.1
  • 22
    • 35048843789 scopus 로고    scopus 로고
    • Elkhound: A fast, practical GLR parser generator
    • CC'04. Duesterwald E. (Ed) 10.1007/b95956
    • McPeak S., and Necula G.C. Elkhound: A fast, practical GLR parser generator. In: Duesterwald E. (Ed). CC'04. Lecture Notes in Computer Science 2985 (2004) 73-88 10.1007/b95956
    • (2004) Lecture Notes in Computer Science , vol.2985 , pp. 73-88
    • McPeak, S.1    Necula, G.C.2
  • 24
    • 41349087418 scopus 로고    scopus 로고
    • Parr, T.J., "The Definitive ANTLR Reference: Building Domain-Specific Languages," The Pragmatic Programmers, 2007
    • Parr, T.J., "The Definitive ANTLR Reference: Building Domain-Specific Languages," The Pragmatic Programmers, 2007
  • 25
  • 26
    • 0016318359 scopus 로고
    • The size of LALR(1) parsers
    • 10.1007/BF01933232
    • Purdom P. The size of LALR(1) parsers. BIT Numerical Mathematics 14 (1974) 326-337 10.1007/BF01933232
    • (1974) BIT Numerical Mathematics , vol.14 , pp. 326-337
    • Purdom, P.1
  • 27
    • 25444447335 scopus 로고    scopus 로고
    • Effective ambiguity checking in biosequence analysis
    • 10.1186/1471-2105-6-153
    • Reeder J., Steffen P., and Giegerich R. Effective ambiguity checking in biosequence analysis. BMC Bioinformatics 6 (2005) 153 10.1186/1471-2105-6-153
    • (2005) BMC Bioinformatics , vol.6 , pp. 153
    • Reeder, J.1    Steffen, P.2    Giegerich, R.3
  • 28
    • 41349117724 scopus 로고    scopus 로고
    • Rossberg, A., Defects in the revised definition of Standard ML, Technical report, Saarland University, Saarbrücken, Germany (2006). URL http://ps.uni-sb.de/Papers/paper_info.php?label=sml-defects
    • Rossberg, A., Defects in the revised definition of Standard ML, Technical report, Saarland University, Saarbrücken, Germany (2006). URL http://ps.uni-sb.de/Papers/paper_info.php?label=sml-defects
  • 29
    • 33746215785 scopus 로고    scopus 로고
    • Noncanonical LALR(1) parsing
    • DLT'06. Dang Z., and Ibarra O.H. (Eds) 10.1007/11779148_10
    • Schmitz S. Noncanonical LALR(1) parsing. In: Dang Z., and Ibarra O.H. (Eds). DLT'06. Lecture Notes in Computer Science 4036 (2006) 95-107 10.1007/11779148_10
    • (2006) Lecture Notes in Computer Science , vol.4036 , pp. 95-107
    • Schmitz, S.1
  • 30
    • 41349083237 scopus 로고    scopus 로고
    • Schmitz, S., Conservative ambiguity detection in context-free grammars, in: ICALP'07, 2007, to appear in Lecture Notes in Computer Science. URL http://www.i3s.unice.fr/~mh/RR/2006/RR-06.30-S.SCHMITZ.pdf
    • Schmitz, S., Conservative ambiguity detection in context-free grammars, in: ICALP'07, 2007, to appear in Lecture Notes in Computer Science. URL http://www.i3s.unice.fr/~mh/RR/2006/RR-06.30-S.SCHMITZ.pdf
  • 32
    • 0742293391 scopus 로고
    • Noncanonical extensions of bottom-up parsing techniques
    • 10.1137/0205019
    • Szymanski T.G., and Williams J.H. Noncanonical extensions of bottom-up parsing techniques. SIAM Journal on Computing 5 (1976) 231-250 10.1137/0205019
    • (1976) SIAM Journal on Computing , vol.5 , pp. 231-250
    • Szymanski, T.G.1    Williams, J.H.2
  • 34
    • 84959063816 scopus 로고    scopus 로고
    • Disambiguation filters for scannerless generalized LR parsers
    • CC'02. Horspool R.N. (Ed) URL
    • van den Brand M., Scheerder J., Vinju J.J., and Visser E. Disambiguation filters for scannerless generalized LR parsers. In: Horspool R.N. (Ed). CC'02. Lecture Notes in Computer Science 2304 (2002) 143-158. http://www.springerlink.com/content/03359k0cerupftfh/ URL
    • (2002) Lecture Notes in Computer Science , vol.2304 , pp. 143-158
    • van den Brand, M.1    Scheerder, J.2    Vinju, J.J.3    Visser, E.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.