Advertisement

Analyzing Context-Free Grammars Using an Incremental SAT Solver

  • Roland Axelsson
  • Keijo Heljanko
  • Martin Lange
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5126)

Abstract

We consider bounded versions of undecidable problems about context-free languages which restrict the domain of words to some finite length: inclusion, intersection, universality, equivalence, and ambiguity. These are in (co)-NP and thus solvable by a reduction to the (un-)satisfiability problem for propositional logic. We present such encodings – fully utilizing the power of incrementat SAT solvers – prove correctness and validate this approach with benchmarks.

Keywords

Word Problem Conjunctive Normal Form Ambiguous Word Parse Tree Propositional Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)MathSciNetGoogle Scholar
  2. 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)Google Scholar
  3. 3.
    Brabrand, C., Giegerich, R., Møller, A.: Analyzing ambiguity of context-free grammars. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 214–225. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  5. 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)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient sat solver. In: DAC, pp. 530–535. ACM, New York (2001)CrossRefGoogle Scholar
  7. 7.
    Quimper, C.-G., Walsh, T.: Decomposing global grammar constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 590–604. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Schmitz, S.: Conservative ambiguity detection in context-free grammars. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 692–703. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Younger, D.H.: Recognition and parsing of context-free languages in time n 3. Information and Control 10(2), 372–375 (1967)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Roland Axelsson
    • 1
  • Keijo Heljanko
    • 2
  • Martin Lange
    • 1
  1. 1.Institut für InformatikLudwig-Maximilians-UniversitätMünchenGermany
  2. 2.Department of Information and Computer ScienceHelsinki University of Technology (TKK)Finland

Personalised recommendations