Analyzing Context-Free Grammars Using an Incremental SAT Solver-Reference-Cited by-同舟云学术

Analyzing Context-Free Grammars Using an Incremental SAT Solver

Published: Issue: Volume: Page:410-422
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Axelsson Roland,Heljanko Keijo,Lange Martin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70583-3_34.pdf

Reference9 articles.

1. Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. Zeitschrift für Phonologie, Sprachwissenschaft und Kommunikationsforschung 14, 113–124 (1961)

2. Basten, H.J.S.: The usability of ambiguity detection methods for context-free grammars. In: Johnstone, A., Vinju, J. (eds.) Eighth Workshop on Language Descriptions, Tools, and Applications (LDTA 2008), Budapest, Hungary (April 2008)

3. Lecture Notes in Computer Science;C. Brabrand,2007

4. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

5. Culik II, K., Cohen, R.S.: LR-regular grammars - an extension of LR(k) grammars. Journal of Computer and System Sciences 7(1), 66–96 (1973)

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automated Ambiguity Detection in Layout-Sensitive Grammars;Proceedings of the ACM on Programming Languages;2023-10-16

2. Demystifying Template-Based Invariant Generation for Bit-Vector Programs;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11

3. Symbolic encoding of LL(1) parsing and its applications;Formal Methods in System Design;2023-06-22

4. Statically Resolvable Ambiguity;Proceedings of the ACM on Programming Languages;2023-01-09

5. Effective Succinct Feedback for Intro CS Theory;Proceedings of the 53rd ACM Technical Symposium on Computer Science Education;2022-02-22