Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 Dean Liu -- 126 2026-10-10 04:21:43 |
2 format Dean Liu -12 word(s) 114 2026-10-10 04:22:37 |

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
No, upload directly Yes
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
Office, E.E. Classic Expression Grammar. Encyclopedia. Available online: https://encyclopedia.pub/entry/60760 (accessed on 23 October 2026).
Office EE. Classic Expression Grammar. Encyclopedia. Available at: https://encyclopedia.pub/entry/60760. Accessed October 23, 2026.
Office, Encyclopedia Editorial. "Classic Expression Grammar" Encyclopedia, https://encyclopedia.pub/entry/60760 (accessed October 23, 2026).
Office, E.E. (2026, October 10). Classic Expression Grammar. In Encyclopedia. https://encyclopedia.pub/entry/60760
Office, Encyclopedia Editorial. "Classic Expression Grammar." Encyclopedia. Web. 10 October, 2026.

Classic Expression Grammar

Edit

In formal grammar and compiler theory, a classic expression grammar is a context-free grammar that specifies the syntactic structure of arithmetic expressions by separating expression components into grammatical categories corresponding to different operator-precedence levels [1]. In its conventional form, the grammar distinguishes expressions involving addition and subtraction, terms involving multiplication and division, and factors involving parenthesized expressions or operands. This hierarchical organization encodes operator precedence and, through recursive production rules, associativity, allowing expressions to be parsed into a structured representation without treating all operators as having equal precedence [1]. The term refers to a grammar used to describe expression syntax, rather than to a general theory of natural-language grammar.

context-free grammar operator precedence associativity expression parsing
Help expand this entry Share your expertise by adding detailed content and references to improve this entry.
Add content

References

  1. Cooper, Keith D., and Linda Torczon. Engineering a Compiler; Elsevier: Amsterdam, NX, Netherlands, 2022. [CrossRef]
More
©Text is available under the terms and conditions of the Creative Commons-Attribution ShareAlike (CC BY-SA) license; additional terms may apply. By using this site, you agree to the Terms and Conditions and Privacy Policy.
Upload a video for this entry
Information
Subjects: Language & Linguistics
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register : Encyclopedia Editorial Office
View Times: 2
Entry Collection: Language and Linguistics
Revisions: 2 times (View History)
Update Date: 22 Oct 2026
Table of Contents
    Notice
    You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
    OK
    Confirm
    Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
    Yes
    No
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    There is no comment~
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    ${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
    Submit
    Cancel
    Confirm
    Are you sure to Delete?
    Yes No
    Write an Entry
    Feedback