메뉴 건너뛰기




Volumn , Issue , 2005, Pages 11-17

Parsing linear context-free rewriting systems

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; DEDUCTION SYSTEMS; OPTIMISATIONS; PARSING ALGORITHM; REWRITING SYSTEMS;

EID: 77956256718     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (21)

References (13)
  • 5
    • 85116892374 scopus 로고    scopus 로고
    • Grammatical Framework and multiple context-free grammars
    • b Nancy, France
    • Peter Ljunglöf. 2004b. Grammatical Framework and multiple context-free grammars. In 9th Conference on Formal Grammar, Nancy, France.
    • (2004) 9th Conference on Formal Grammar
    • Ljunglöf, Peter1
  • 7
    • 1142267381 scopus 로고    scopus 로고
    • Grammatical Framework, a type-theoretical grammar formalism
    • Aarne Ranta. 2004. Grammatical Framework, a type-theoretical grammar formalism. Journal of Functional Programming, 14(2):145-189.
    • (2004) Journal of Functional Programming , vol.14 , Issue.2 , pp. 145-189
    • Ranta, Aarne1
  • 10
    • 0002525206 scopus 로고    scopus 로고
    • Parsing of context-free languages
    • G. Rozenberg and A. Salomaa, editors, pages Springer-Verlag, Berlin
    • Klaas Sikkel and Anton Nijholt. 1997. Parsing of context-free languages. In G. Rozenberg and A. Salomaa, editors, The Handbook of Formal Languages, volume II, pages 61-100. Springer-Verlag, Berlin.
    • (1997) The Handbook of Formal Languages , vol.II , pp. 61-100
    • Sikkel, Klaas1    Nijholt, Anton2
  • 13
    • 49949139581 scopus 로고
    • Recognition of context-free languages in time n3
    • Daniel H Younger. 1967. Recognition of context-free languages in time n3. Information and Control, 10(2):189-208.
    • (1967) Information and Control , vol.10 , Issue.2 , pp. 189-208
    • Younger, Daniel H1


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