LR Formalisms as Abstract Interpretations of Grammar Semantics(Automata and Formal Language Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• The concept of LR(k) validity is represented as an abstract interpretation of a refinement of the derivation semantics of a given grammar. Also the algorithm of LR(k) parsing is represented as an abstract interpretation of the refined semantics. Such representations of LR formalisms provide us with more intuitive and easier means by which to understand LR parsing

• 社団法人電子情報通信学会の論文
• 2006-12-01

著者

• CHOE Kwang-Moo

  Division of Computer Science

• Choe Kwang‐moo

  Kaist Daejeon Kor

• O Seunghwan

  Division of Computer Science, Korea Advanced Institute of Science and Technology

• O Seunghwan

  Division Of Computer Science Korea Advanced Institute Of Science And Technology

関連論文

• Over-Approximated Control Flow Graph Construction on Pure Esterel
• LR Formalisms as Abstract Interpretations of Grammar Semantics(Automata and Formal Language Theory)

スポンサーリンク