article

Free access

An Algorithm for Translating Boolean Expressions

Authors:

Bruce W. Arden,

Bernard A. Galler,

Robert M. GrahamAuthors Info & Claims

Journal of the ACM (JACM), Volume 9, Issue 2

Pages 222 - 239

https://doi.org/10.1145/321119.321121

Published: 01 April 1962 Publication History

PDF eReader

References

[1]

ROSIN, ROBERT :F. An introductory problem in symbol manipulation for the student. Comm. ACM 8, (Sept. 1960), 488.

Crossref

Google Scholar

[2]

ARDEN, BRUCE W. AND GRAHAM, ROBERT M. On GAT and the construction of translators. Comm. ACM 2, (July, 1959), 24.

Crossref

Google Scholar

[3]

HUSKEY, HARRY D. and WAWrENBURO, W. I t . Compiling techniques for Boolean expressions and conditional statements in ALGOL 60. Comm. ACM 4, (Jan. 1961), 70.

Crossref

Google Scholar

Cited By

View all

Gasser RRossetto LHeller SSchuldt H(2022)Multimedia Retrieval and Analysis with Cottontail DBACM SIGMultimedia Records10.1145/3577934.357794013:1(1-1)Online publication date: 19-Dec-2022
https://dl.acm.org/doi/10.1145/3577934.3577940
Chen LCao JLiang WWu JYe Q(2022)Keywords-enhanced Deep Reinforcement Learning Model for Travel RecommendationACM Transactions on the Web10.1145/357095917:1(1-21)Online publication date: 20-Dec-2022
https://dl.acm.org/doi/10.1145/3570959
Zou LLu WLiu YCai HChu XMa DShi DSun YCheng ZGu SWang SYin D(2022)Pre-trained Language Model-based Retrieval and Ranking for Web SearchACM Transactions on the Web10.1145/356868117:1(1-36)Online publication date: 20-Dec-2022
https://dl.acm.org/doi/10.1145/3568681
Show More Cited By

Index Terms

An Algorithm for Translating Boolean Expressions
1. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata

We prove that every regular expression of size n can be converted into an equivalent nondeterministic -free finite automaton (NFA) with O(n(logn)2) transitions in time O(n2logn). The best previously known conversions result in NFAs of worst-case size (...
Bit-Parallel Algorithms for Translating Regular Expressions into NFAs

The aim of the paper is to design efficient bit-parallel algorithms for translating regular expressions into nondeterministic finite automata (NFAs). Let r be a regular expression over an alphabet Σ, and let n be the length of r and let m be the number ...
Boolean grammars: expressive power and parsing algorithms

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 9, Issue 2

April 1962

136 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321119

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1962

Published in JACM Volume 9, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

33
Total Citations
View Citations
709
Total Downloads

Downloads (Last 12 months)64
Downloads (Last 6 weeks)9

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gasser RRossetto LHeller SSchuldt H(2022)Multimedia Retrieval and Analysis with Cottontail DBACM SIGMultimedia Records10.1145/3577934.357794013:1(1-1)Online publication date: 19-Dec-2022
https://dl.acm.org/doi/10.1145/3577934.3577940
Chen LCao JLiang WWu JYe Q(2022)Keywords-enhanced Deep Reinforcement Learning Model for Travel RecommendationACM Transactions on the Web10.1145/357095917:1(1-21)Online publication date: 20-Dec-2022
https://dl.acm.org/doi/10.1145/3570959
Zou LLu WLiu YCai HChu XMa DShi DSun YCheng ZGu SWang SYin D(2022)Pre-trained Language Model-based Retrieval and Ranking for Web SearchACM Transactions on the Web10.1145/356868117:1(1-36)Online publication date: 20-Dec-2022
https://dl.acm.org/doi/10.1145/3568681
Rangan RStephenson MUkarande AMurthy SAgarwal VBlackstein M(2020)ZeroploitACM Transactions on Architecture and Code Optimization10.1145/339428417:3(1-26)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3394284
Akera A(2008)The Life and Work of Bernard A. Galler (1928-2006)IEEE Annals of the History of Computing10.1109/MAHC.2008.1530:1(4-14)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1109/MAHC.2008.15
Ghodrat MGivargis TNicolau A(2007)Short-Circuit Compiler TransformationProceedings of the 2007 Asia and South Pacific Design Automation Conference10.1109/ASPDAC.2007.358036(504-510)Online publication date: 23-Jan-2007
https://dl.acm.org/doi/10.1109/ASPDAC.2007.358036
Griss MHearn A(2006)A portable lisp compilerSoftware: Practice and Experience10.1002/spe.438011060311:6(541-605)Online publication date: 27-Oct-2006
https://doi.org/10.1002/spe.4380110603
Clifton MKing K(1998)A comparison of space requirements for short-circuit and full evaluation of Boolean expressionsProceedings of the 36th annual ACM Southeast Conference10.1145/275295.275367(261-267)Online publication date: 1-Apr-1998
https://dl.acm.org/doi/10.1145/275295.275367
Bacon DGraham SSharp O(1994)Compiler transformations for high-performance computingACM Computing Surveys10.1145/197405.19740626:4(345-420)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.1145/197405.197406
Minker JMinker R(1980)Optimization of Boolean Expressions-Historical DevelopmentsIEEE Annals of the History of Computing10.1109/MAHC.1980.100292:3(227-238)Online publication date: 1-Jul-1980
https://dl.acm.org/doi/10.1109/MAHC.1980.10029
Show More Cited By

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.

References

Cited By

Index Terms

Recommendations

Translating Regular Expressions into Small ε-Free Nondeterministic Finite Automata

Bit-Parallel Algorithms for Translating Regular Expressions into NFAs

Boolean grammars: expressive power and parsing algorithms

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations