Is LALR(2) able to handle the dangling else case naturally (without any special rules, as with LALR(1))?
Thanks
2
There are 2 best solutions below
Related Questions in PARSING
- TypeScript: Type checking while parsing an arbitrary JSON that is typed/
- How to have fixed options using Option.Applicative in haskell?
- How to convert mathematical expression to lambda function in C++?
- JsonObject throws an exception: JSONObject["employer_website"] is not a string (class org.json.JSONObject$Null : null)
- Trying to fix my c++ code for it to read the right amount of nodes from a file
- Selenium get page after "loading" page
- Parse tag in html via Google Sheets (importxml)
- FluentD / Fluent-Bit: Concatenate multiple lines of log files and generate one JSON record for all key-value from each line
- Editing non-String values in JComboBox
- Handling multiple errors in Bison parser
- Which is the most idiomatic way to parse an i32 from ascii in Rust
- I got this error from a JSON Validator - what does this mean?
- Conflict between lexer rules in ANTLR4 for Fortran grammar
- mqtt message parsing problem in a node.js
- How to print error code from URL response in swift
Related Questions in COMPILER-THEORY
- What is the point of the 4 grammars specified in Chomsky hierarchy?
- How does the latest ANTLR4 resolve the "dangling else" ambiguity?
- Why don't most interpreted languages like ruby provide an optional compiler?
- Print integers as strings in mips programs
- Exercise 4.2.8 from "Compilers - Principles, Techniques, & Tools" (a.k.a. Dragon Book)
- Eliminate Left Recursion in a Context Free Grammar
- What is Local and Global optimization in Compiler Design?
- Interpreter and Compiler
- Why can't compilers automatically optimize regular recursion?
- Computing Liveness of Arrays and Other Non-Scalars in Low Level Intermediate Code
- can I reduce executable file size by defining funtions in source code?
- How easy is to find a string that leads to conflict in a SLR(1) parser compared to a LR(1)
- Finding a grammar is not LL(1) without using classical methods and transforming it to LL(1)
- Is this an intermediate representation?
- Writing a Compiler in C
Related Questions in LALR
- Is this grammar LALR(1)?
- Can the grammar of the concatenation of two lists with common elements be written as an LALR grammar without any collisions
- Repeating on the same rule again and again in CFG-parser
- can't understand this LALR(1) parsing algorithm in aho & Ullman book
- Accept an optional substring with Lark's LALR(1) parser
- LALR(1) Parser DFA Lookahead Core Question
- How to turn a Grammar to LR(0)
- How can I resolve this shift-reduce conflict?
- How to understand Example-4.64 of the syntax analysis chapter in Dragon Book?
- LALR, LR(1) and SLR
- How to resolve a shift/reduce conflict for nested lists using the same separator in JFLEX/CUP?
- LALR Grammar desambiguation for function calls statements (as in Python grammar)
- Should a merge failure stop the LR(1) to LALR(1) conversion
- How to handle operator precedence in LALR(1) parser
- Python LARK: terminal character inside text confusion
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
It's ambiguous, however, it's not a problem, because a well behaved LALR parser generator will resolve the ambiguity by choosing the shift instead of the reduce choice. This is what you want -- the "else" to be matched with the previous "if" statement. So the conclusion is: there is no problem. You just have to understand the default choice which the parser generator makes for all shift-reduce ambiguities. This default can be overridden with disambiguating rules or something like the "%prec" operator in "yacc".
But that is a more advanced topic.