Ambiguous grammar (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ambiguous grammar" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

3worldcat.org

5^th place

3semanticscholar.org

11^th place

8^th place

1books.google.com

3^rd place

1aclweb.org

low place

6,793^rd place

1hut.fi

low place

1mathoverflow.net

low place

1inria.fr

4,903^rd place

3,679^th place

1web.archive.org

1^st place

aclweb.org

anthology.aclweb.org

Tomita, Masaru. "An efficient augmented-context-free parsing algorithm." Computational linguistics 13.1-2 (1987): 31-46.

books.google.com

Willem J. M. Levelt (2008). An Introduction to the Theory of Formal Languages and Automata. John Benjamins Publishing. ISBN 978-90-272-3250-2.

doi.org

Scott, Elizabeth (April 1, 2008). "SPPF-Style Parsing From Earley Recognizers". Electronic Notes in Theoretical Computer Science. 203 (2): 53–67. doi:10.1016/j.entcs.2008.03.044.
Axelsson, Roland; Heljanko, Keijo; Lange, Martin (2008). "Analyzing Context-Free Grammars Using an Incremental SAT Solver" (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08), Reykjavik, Iceland. Lecture Notes in Computer Science. Vol. 5126. Springer-Verlag. pp. 410–422. doi:10.1007/978-3-540-70583-3_34. ISBN 978-3-540-70582-6.
Knuth, D. E. (July 1965). "On the translation of languages from left to right". Information and Control. 8 (6): 607–639. doi:10.1016/S0019-9958(65)90426-2.
Book, R.; Even, S.; Greibach, S.; Ott, G. (Feb 1971). "Ambiguity in Graphs and Expressions". IEEE Transactions on Computers. C-20 (2): 149–153. doi:10.1109/t-c.1971.223204. ISSN 0018-9340. S2CID 20676251.
Parikh, Rohit J. (1966-10-01). "On Context-Free Languages". Journal of the ACM. 13 (4): 570–581. doi:10.1145/321356.321364. ISSN 0004-5411. S2CID 12263468. Here: Theorem 3.
Ogden, William (Sep 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.

dx.doi.org

Book, R.; Even, S.; Greibach, S.; Ott, G. (Feb 1971). "Ambiguity in Graphs and Expressions". IEEE Transactions on Computers. C-20 (2): 149–153. doi:10.1109/t-c.1971.223204. ISSN 0018-9340. S2CID 20676251.
Ogden, William (Sep 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.

hut.fi

tcs.hut.fi

Axelsson, Roland; Heljanko, Keijo; Lange, Martin (2008). "Analyzing Context-Free Grammars Using an Incremental SAT Solver" (PDF). Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP'08), Reykjavik, Iceland. Lecture Notes in Computer Science. Vol. 5126. Springer-Verlag. pp. 410–422. doi:10.1007/978-3-540-70583-3_34. ISBN 978-3-540-70582-6.

inria.fr

algo.inria.fr

Fredérique Bassino and Cyril Nicaud (December 16, 2011). "Philippe Flajolet & Analytic Combinatorics: Inherent Ambiguity of Context-Free Languages" (PDF). Archived (PDF) from the original on 2022-09-25.

mathoverflow.net

"formal languages - Can regular expressions be made unambiguous?". MathOverflow. Retrieved 2023-02-23.

semanticscholar.org

api.semanticscholar.org

Book, R.; Even, S.; Greibach, S.; Ott, G. (Feb 1971). "Ambiguity in Graphs and Expressions". IEEE Transactions on Computers. C-20 (2): 149–153. doi:10.1109/t-c.1971.223204. ISSN 0018-9340. S2CID 20676251.
Parikh, Rohit J. (1966-10-01). "On Context-Free Languages". Journal of the ACM. 13 (4): 570–581. doi:10.1145/321356.321364. ISSN 0004-5411. S2CID 12263468. Here: Theorem 3.
Ogden, William (Sep 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.

web.archive.org

Fredérique Bassino and Cyril Nicaud (December 16, 2011). "Philippe Flajolet & Analytic Combinatorics: Inherent Ambiguity of Context-Free Languages" (PDF). Archived (PDF) from the original on 2022-09-25.

worldcat.org

search.worldcat.org

Book, R.; Even, S.; Greibach, S.; Ott, G. (Feb 1971). "Ambiguity in Graphs and Expressions". IEEE Transactions on Computers. C-20 (2): 149–153. doi:10.1109/t-c.1971.223204. ISSN 0018-9340. S2CID 20676251.
Parikh, Rohit J. (1966-10-01). "On Context-Free Languages". Journal of the ACM. 13 (4): 570–581. doi:10.1145/321356.321364. ISSN 0004-5411. S2CID 12263468. Here: Theorem 3.
Ogden, William (Sep 1968). "A helpful result for proving inherent ambiguity". Mathematical Systems Theory. 2 (3): 191–194. doi:10.1007/bf01694004. ISSN 0025-5661. S2CID 13197551.