SCOPUS 정보 검색 플랫폼

Volumn 34, Issue 4, 1997, Pages 267-289

Dynamic LL(k) parsing

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS;

DYNAMIC CONTEXT FREE GRAMMARS;

CONTEXT FREE GRAMMARS;

EID: 0039327356 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050085 Document Type: Article

Times cited : (5)

References (13)

1
- 0016543997
- Deterministic parsing of ambiguous grammars
- A.V. Aho, S.C. Johnson, J.D. Ullman: Deterministic Parsing of Ambiguous Grammars, Comm. ACM 18 (8) (1975), 441-452
- (1975) Comm. ACM , vol.18 , Issue.8 , pp. 441-452
- Aho, A.V.¹ Johnson, S.C.² Ullman, J.D.³

2
- 0003791899
- Prentice Hall, Englewood Cliffs, NJ
- A.V. Aho, J.D. Ullman: The Theory of Parsing, Translation and Compiling, Vol. 1 & 2, Prentice Hall, Englewood Cliffs, NJ, 1972
- (1972) The Theory of Parsing, Translation and Compiling , vol.1-2
- Aho, A.V.¹ Ullman, J.D.²

3
- 0040220848
- Ph.D. Thesis, Lawrence Livermore Laboratory, University of California, Livermore
- J.C. Beatty: Iteration Theorems for the LL(k) Languages, Ph.D. Thesis, Lawrence Livermore Laboratory, University of California, Livermore, 1977
- (1977) Iteration Theorems for the LL(k) Languages
- Beatty, J.C.¹

4
- 84976728026
- Two iteration theorems for the LL(k) languages
- J.C. Beatty: Two Iteration Theorems for the LL(k) Languages, Theoretical Computer Science 12 (1980), 193-228
- (1980) Theoretical Computer Science , vol.12 , pp. 193-228
- Beatty, J.C.¹

5
- 0003866821
- Benjamin/Cummings, Redwood City, CA
- C.N. Fischer, R.J. LeBlanc: Crafting a Compiler with C, Benjamin/Cummings, Redwood City, CA, 1991
- (1991) Crafting a Compiler with C
- Fischer, C.N.¹ LeBlanc, R.J.²

6
- 0003626841
- Addison-Wesley, Reading, MA
- M.A. Harrison: Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978
- (1978) Introduction to Formal Language Theory
- Harrison, M.A.¹

7
- 0040173688
- A parsing automata approach to LR theory
- S. Heilbrunner: A Parsing Automata Approach to LR Theory, Theoretical Computer Science 15 (1981), 117-157
- (1981) Theoretical Computer Science , vol.15 , pp. 117-157
- Heilbrunner, S.¹

8
- 0003620778
- Addison-Wesley, Reading, MA
- J.E. Hopcroft, J.D. Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979
- (1979) Introduction to Automata Theory, Languages and Computation
- Hopcroft, J.E.¹ Ullman, J.D.²

9
- 85027418765
- Adding semantic and syntactic predicates to LL(k): Pred-LL(k)
- T.J. Parr, R.W. Quong: Adding Semantic and Syntactic Predicates to LL(k): pred-LL(k), Lecture Notes in Computer Science 786 (1994), 263-277
- (1994) Lecture Notes in Computer Science , vol.786 , pp. 263-277
- Parr, T.J.¹ Quong, R.W.²

10
- 0004392820
- Properties of deterministic top-down grammars
- D.J. Rosencrantz, R.E. Stearns: Properties of Deterministic Top-Down Grammars, Information & Control 17 (1970), 226-256
- (1970) Information & Control , vol.17 , pp. 226-256
- Rosencrantz, D.J.¹ Stearns, R.E.²

11
- 21344488715
- Rediscovering pushdown machines
- K. Salomaa, D. Wood, S. Yu: Rediscovering Pushdown Machines, Lecture Notes in Computer Science 812 (1994), 372-385
- (1994) Lecture Notes in Computer Science , vol.812 , pp. 372-385
- Salomaa, K.¹ Wood, D.² Yu, S.³

12
- 0039036817
- Succintness of descriptions of unambiguous context-free languages
- E.M. Schmidt, T. Szymanski: Succintness of Descriptions of Unambiguous Context-free Languages, SIAM Journal on Computing 6 (1977), 547-553
- (1977) SIAM Journal on Computing , vol.6 , pp. 547-553
- Schmidt, E.M.¹ Szymanski, T.²

13
- 0039503373
- Springer, Heidelberg
- S. Sippu, E. Soisalon-Soininen: Parsing Theory, Vol. 2: LR(k), LL(k) Parsing, EATCS Monographs, Springer, Heidelberg, 1990
- (1990) Parsing Theory, Vol. 2: LR(k), LL(k) Parsing, EATCS Monographs , vol.2
- Sippu, S.¹ Soisalon-Soininen, E.²

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