YakYak: Parsing with Logical Side Constraints

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Standard

YakYak: Parsing with Logical Side Constraints. / Hansen, Niels Damgaard; Klarlund, Nils; Schwartzbach, Michael Ignatieff.

Proceedings of the 4th International Conference on Development in Language Theory. ed. / Grzegorz Rozenberg; Wolfgang Thomas. World Scientific, 2000. p. 286-301.

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Harvard

Hansen, ND, Klarlund, N & Schwartzbach, MI 2000, YakYak: Parsing with Logical Side Constraints. in G Rozenberg & W Thomas (eds), Proceedings of the 4th International Conference on Development in Language Theory. World Scientific, pp. 286-301, International Conference on Development in Language Theory, Archen, Germany, 13/10/1999.

APA

Hansen, N. D., Klarlund, N., & Schwartzbach, M. I. (2000). YakYak: Parsing with Logical Side Constraints. In G. Rozenberg, & W. Thomas (Eds.), Proceedings of the 4th International Conference on Development in Language Theory (pp. 286-301). World Scientific.

CBE

Hansen ND, Klarlund N, Schwartzbach MI. 2000. YakYak: Parsing with Logical Side Constraints. Rozenberg G, Thomas W, editors. In Proceedings of the 4th International Conference on Development in Language Theory. World Scientific. pp. 286-301.

MLA

Hansen, Niels Damgaard, Nils Klarlund and Michael Ignatieff Schwartzbach "YakYak: Parsing with Logical Side Constraints". and Rozenberg, Grzegorz Thomas, Wolfgang (editors). Proceedings of the 4th International Conference on Development in Language Theory. World Scientific. 2000, 286-301.

Vancouver

Hansen ND, Klarlund N, Schwartzbach MI. YakYak: Parsing with Logical Side Constraints. In Rozenberg G, Thomas W, editors, Proceedings of the 4th International Conference on Development in Language Theory. World Scientific. 2000. p. 286-301

Author

Hansen, Niels Damgaard ; Klarlund, Nils ; Schwartzbach, Michael Ignatieff. / YakYak: Parsing with Logical Side Constraints. Proceedings of the 4th International Conference on Development in Language Theory. editor / Grzegorz Rozenberg ; Wolfgang Thomas. World Scientific, 2000. pp. 286-301

Bibtex

@inproceedings{6d52dd40a8f311dea554000ea68e967b,
title = "YakYak: Parsing with Logical Side Constraints",
abstract = "Programming language syntax is often described by means of a context-free grammar, which is restricted by constraints programmed into the action code associated with productions. Without such code, the grammar would explode in size if it were to describe the same language.We present the tool YakYak, which extends Yacc with first-order logic for specifying consteaints that are regular tree languages. Concise formulas about the parse tree replace explicit programming, and they are turned into canonical attribute grammars through tree automata calculations. YakYak is implemented as a proprocessor for Yacc, in which the transitions of the calculated tree automata are merged into the action code. We provide both practical experience and theoretical evidence that the YakYak approach results in fast and consisely specified parsers.",
author = "Hansen, {Niels Damgaard} and Nils Klarlund and Schwartzbach, {Michael Ignatieff}",
year = "2000",
language = "English",
isbn = "981-02-4380-4",
pages = "286--301",
editor = "Grzegorz Rozenberg and Wolfgang Thomas",
booktitle = "Proceedings of the 4th International Conference on Development in Language Theory",
publisher = "World Scientific",

}

RIS

TY - GEN

T1 - YakYak: Parsing with Logical Side Constraints

AU - Hansen, Niels Damgaard

AU - Klarlund, Nils

AU - Schwartzbach, Michael Ignatieff

PY - 2000

Y1 - 2000

N2 - Programming language syntax is often described by means of a context-free grammar, which is restricted by constraints programmed into the action code associated with productions. Without such code, the grammar would explode in size if it were to describe the same language.We present the tool YakYak, which extends Yacc with first-order logic for specifying consteaints that are regular tree languages. Concise formulas about the parse tree replace explicit programming, and they are turned into canonical attribute grammars through tree automata calculations. YakYak is implemented as a proprocessor for Yacc, in which the transitions of the calculated tree automata are merged into the action code. We provide both practical experience and theoretical evidence that the YakYak approach results in fast and consisely specified parsers.

AB - Programming language syntax is often described by means of a context-free grammar, which is restricted by constraints programmed into the action code associated with productions. Without such code, the grammar would explode in size if it were to describe the same language.We present the tool YakYak, which extends Yacc with first-order logic for specifying consteaints that are regular tree languages. Concise formulas about the parse tree replace explicit programming, and they are turned into canonical attribute grammars through tree automata calculations. YakYak is implemented as a proprocessor for Yacc, in which the transitions of the calculated tree automata are merged into the action code. We provide both practical experience and theoretical evidence that the YakYak approach results in fast and consisely specified parsers.

M3 - Article in proceedings

SN - 981-02-4380-4

SP - 286

EP - 301

BT - Proceedings of the 4th International Conference on Development in Language Theory

A2 - Rozenberg, Grzegorz

A2 - Thomas, Wolfgang

PB - World Scientific

ER -