<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[laoleeka的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/laoleeka</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; laoleeka]]></copyright><item><title><![CDATA[【逆向分析】单机锁血无敌功能分析]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/126987484</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/126987484</guid><author>laoleeka</author><pubDate>Thu, 22 Sep 2022 11:18:19 +0800</pubDate><description><![CDATA[逆向分析：无敌功能的分析。反外挂基础。]]></description><category></category></item><item><title><![CDATA[《逆向工程核心原理》精读——第11章视频讲座（破解Tut.ReverseMel.exe）]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/126513325</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/126513325</guid><author>laoleeka</author><pubDate>Thu, 25 Aug 2022 00:20:52 +0800</pubDate><description><![CDATA[《逆向工程核心原理》精读——第11章视频讲座（破解Tut.ReverseMel.exe）]]></description><category></category></item><item><title><![CDATA[阅读《自制编程语言》之递归下降]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/79307930</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/79307930</guid><author>laoleeka</author><pubDate>Sun, 11 Feb 2018 02:54:42 +0800</pubDate><description><![CDATA[书中举了一个例子来说明语法分析中的下降递归，还是计算器。0、准备工作token.h文件#ifndef TOKEN_H#define  TOKEN_Htypedef enum { BAD_TOKEN, NUMBER_TOKEN, ADD, SUB, MUL, DIV, END}TokenKind;           // 词的类型#define MAX_TOKEN_LENG     1000typ...]]></description><category></category></item><item><title><![CDATA[阅读《自制编程语言》之使用flex&bison和c语言制作一个简易计算器]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/79301652</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/79301652</guid><author>laoleeka</author><pubDate>Fri, 09 Feb 2018 20:25:16 +0800</pubDate><description><![CDATA[写在前面：这本书相当于给没有什么编译原理基础又想要做一个玩具的程序猿做的一个很浅的科普。但它确确实实能走一遍流程。 昨天翻了翻《龙书》，实在受不了，对菜逼太不友好了。网上一搜，有人推荐这本书。好在手头有这个玩意儿，都快蒙灰了，就拉出来看看，简直感动要哭，真的是一步一步喂到嘴里，最重要的是它简单哈哈。话不多说，上教程。准备工作 ：linux在windows当中安装虚拟机然后下载linux镜像的教...]]></description><category></category></item><item><title><![CDATA[二叉树的遍历（递归+非递归+层次遍历）]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/53143574</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/53143574</guid><author>laoleeka</author><pubDate>Sat, 12 Nov 2016 22:23:54 +0800</pubDate><description><![CDATA[按照严蔚敏版本的伪代码写的
#include<stdio.h>
#include<stdlib.h>
#define     OK  1
#define     OVERFLOW    0
typedef     int     Status;
typedef struct  BiTNode {
    char data;
    struct   BiTNode *lchild, *rchild;]]></description><category></category></item><item><title><![CDATA[表达式求值]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/52963914</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/52963914</guid><author>laoleeka</author><pubDate>Sat, 29 Oct 2016 12:22:33 +0800</pubDate><description><![CDATA[顺序栈
表达式求值]]></description><category></category></item><item><title><![CDATA[约瑟夫环]]></title><link>https://blog.youkuaiyun.com/laoleeka/article/details/52963660</link><guid>https://blog.youkuaiyun.com/laoleeka/article/details/52963660</guid><author>laoleeka</author><pubDate>Sat, 29 Oct 2016 11:56:31 +0800</pubDate><description><![CDATA[简单约瑟夫环的实现，主要使用链表
这应该是大多数在校生的第一个数据结构吧]]></description><category></category></item></channel></rss>