• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Advisory Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Scientia Iranica
Articles in Press
Current Issue
Journal Archive
Volume Volume 25 (2018)
Volume Volume 24 (2017)
Volume Volume 23 (2016)
Volume Volume 22 (2015)
Volume Volume 21 (2014)
Volume Volume 20 (2013)
Issue Issue 6
Transactions on Nanotechnology (F)
Issue Issue 6
Transactions on Industrial Engineering (E)
Issue Issue 6
Transactions on Computer Science & Engineering and Electrical Engineering (D)
Issue Issue 6
Transactions on Chemistry and Chemical Engineering (C)
Issue Issue 6
Transactions on Mechanical Engineering (B)
Issue Issue 6
Transactions on Civil Engineering (A)
Issue Issue 5
Transactions on Mechanical Engineering (B)
Issue Issue 5
Transactions on Civil Engineering (A)
Issue Issue 4
Transactions on Mechanical Engineering (B)
Issue Issue 4
Transactions on Civil Engineering (A)
Volume Volume 17 (2010)
Volume Volume 16 (2009)
Volume Volume 15 (2008)
Volume Volume 14 (2007)
Volume Volume 13 (2006)
Volume Volume 12 (2005)
Volume Volume 11 (2004)
Volume Volume 10 (2003)
Volume Volume 9 (2002)
Volume Volume 8 (2001)
Volume Volume 7 (2000)
Volume Volume 6 (1999)
Volume Volume 5 (1998)
Volume Volume 4 (1997)
Volume Volume 3 (1996)
Volume Volume 2 (1995)
Volume Volume 1 (1994)

Scientia Iranica

Scientia Rank

Jaberipur, G., Dorrigiv, M. (2013). Formal Ambiguity-resolving Syntax Definition with Asserted Shift Reduce Sets. Scientia Iranica, 20(6), 1939-1952.
Ghassem Jaberipur; Morteza Dorrigiv. "Formal Ambiguity-resolving Syntax Definition with Asserted Shift Reduce Sets". Scientia Iranica, 20, 6, 2013, 1939-1952.
Jaberipur, G., Dorrigiv, M. (2013). 'Formal Ambiguity-resolving Syntax Definition with Asserted Shift Reduce Sets', Scientia Iranica, 20(6), pp. 1939-1952.
Jaberipur, G., Dorrigiv, M. Formal Ambiguity-resolving Syntax Definition with Asserted Shift Reduce Sets. Scientia Iranica, 2013; 20(6): 1939-1952.

Formal Ambiguity-resolving Syntax Definition with Asserted Shift Reduce Sets

Article 1, Volume 20, Issue 6 - Issue Serial Number 12, December 2013, Page 1939-1952  XML PDF (4739 K)
Authors
Ghassem Jaberipur1; Morteza Dorrigiv2
1Department of Electrical and Computer Engineering,Shahid Beheshti University and School of Computer Science,the Institute for Research in Fundamental Science (IPM),Tehran, Iran
2Department of Electrical and Computer Engineering,Shahid Beheshti University,Tehran, Iran
Abstract
There are parser generators that accept ambiguous context-free grammars, where ambiguities are resolved via disambiguation rules, with the outcome of smaller parse tables and more efficient parsers. However, the compiler writers are expected to develop compact ambiguous grammars and extract ambiguity-resolving information from the syntax and semantics of the language. The aforementioned tasks require considerable expertise, not often owned by casual compiler writers, or even expert programmers who are assigned a serious compiler-writing task, while programming language designers are, usually, capable of providing a concise and compact ambiguous description of the language that may include ambiguity-resolving information.In this paper, we aim to provide a powerful notation for syntax definition, which enables the language designer to assert some shift and reduce sets associated with each production rule of the possibly ambiguous grammar. These sets of language tokens guide the parser generator to resolve the parse table conflicts that are caused by the ambiguities in the grammar or by other sources. The practicality of the proposed asserted shift reduce notation is supported by several examples from the constructs of contemporary programming languages and is tested to work properly via developing a parser generator that constructs conflict-free LALR (1) parse tables.
Keywords
parsing; shift reduce parsers; parser generators; ambiguous grammars; programming languages; compilers
Statistics
Article View: 972
PDF Download: 187
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

© 2017 scientiairanica

Journal Management System. Designed by sinaweb.