Article

Free access

Dividing patterns into deterministic regions

Authors:

Binh Duong,

K. M. GeorgeAuthors Info & Claims

SAC '86: Proceedings of the 1986 workshop on Applied computing

Pages 53 - 57

https://doi.org/10.1145/800239.807174

Published: 10 October 1986 Publication History

PDF eReader

Abstract

The LR(k) parsing provides a deterministic table driven algorithm for pattern recognition. An LR parser scans the text from left to right while reducing handles. The process is sequential in nature. This paper describes a parsing method based on SLR(1) parse table. A pre-parsing phase is used to divide an input pattern into deterministic regions. Each region reduces to a minimal sub-phrase. The regions can be parsed simultaneously using portions of the SLR(1) parse table for the whole grammar.

References

[1]

Alfred V. Aho and Jeffrey D. Ullman, Principles of Compiler Design, Addison-Wesley Publishing Company, 1977.

Digital Library

Google Scholar

[2]

F. Baccelli and T. Fleury, On Parsing Arithmetic Expressions in a Multiprocessing Environment, Acta Informatica, Vol. 17, pp. 287-310, 1982.

Digital Library

Google Scholar

[3]

F. Baccelli and P. Mussi, An Asynchronous Parallel Interpreter for Arithmetic Expression and Its Evaluation, IEEE Transactions on Computers, Vol. C - 35, No. 3, March, 1986.

Google Scholar

[4]

D. Ligett, G. McCluskey, W. M. McKeeman, Parallel LR Parsing, Technical Report TR-32-03, School of Information Technology, Wang Institute of Graduate Studies, July, 1982.

Google Scholar

Index Terms

Dividing patterns into deterministic regions
1. Computing methodologies
  1. Machine learning
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms
      1. Rewrite systems
    2. Grammars and context-free languages

Recommendations

Deterministic parsing of ambiguous grammars

Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve ...
Simplifying deterministic parsing
ACL '84/COLING '84: Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics

This paper presents a model for deterministic parsing which was designed to simplify the task of writing and understanding a deterministic grammar. While retaining structures and operations similar to those of Marcus' PARSIFAL parser [Marcus 80] the ...
Deterministic left to right parsing of Tree Adjoining Languages
ACL '90: Proceedings of the 28th annual meeting on Association for Computational Linguistics

We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended to Tree Adjoining Grammars (TAGs). We use a machine, called Bottom-up ...

Comments

Information & Contributors

Information

Published In

SAC '86: Proceedings of the 1986 workshop on Applied computing

October 1986

65 pages

ISBN:9781450379052

DOI:10.1145/800239

Editors:
Y. Breitbart,
D. Fisher

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 October 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
195
Total Downloads

Downloads (Last 12 months)35
Downloads (Last 6 weeks)4

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Deterministic parsing of ambiguous grammars

Simplifying deterministic parsing

Deterministic left to right parsing of Tree Adjoining Languages

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

PDF

eReader

Login options

Full Access

Abstract

References

Index Terms

Recommendations

Deterministic parsing of ambiguous grammars

Simplifying deterministic parsing

Deterministic left to right parsing of Tree Adjoining Languages

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations