<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[shenjun134的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/shenjun134</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; shenjun134]]></copyright><item><title><![CDATA[ANTLR学习]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/103994944</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/103994944</guid><author>shenjun134</author><pubDate>Wed, 15 Jan 2020 19:32:08 +0800</pubDate><description><![CDATA[**ANTLR学习笔记一：概念理解 **
一、什么是ANTLR。
ANTLR是ANother Tool for Language Recognition的缩写，
意为“另一种语言识别工具”，读作Antler。
它是一种解析器程序的代码生成器（作用类似于YACC），
使用LL(*)方法，即从输入字符串的左到右，
用候选项的最左符号匹配输入（即与所有以终结符开头的候选项匹配），
每次向前（右）看n个符...]]></description><category></category></item><item><title><![CDATA[通过城市代码获取免费天气预报]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84384439</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84384439</guid><author>shenjun134</author><pubDate>Wed, 23 Jan 2013 09:54:54 +0800</pubDate><description><![CDATA[这里主要用到就是通过城市名称获取城市代码，拼装URL去方位免费天气预报的网站获取资源信息，然后保存解析，展现给user。
如果想要运行下面的代码，首先要新建一个PHP的project，把下面三个文件拷贝进去，然后开启server，在浏览器上运行，如果不能访问，可以转换下你PC的代理，应该可以访问。有问题可以联系我~谢谢


[code=&quot;html&quot;]



Insert title...]]></description><category></category></item><item><title><![CDATA[eclipse screen shot ]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84286725</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84286725</guid><author>shenjun134</author><pubDate>Mon, 10 Sep 2012 10:27:15 +0800</pubDate><description><![CDATA[eclipse 上的截图工具
plugin]]></description><category></category></item><item><title><![CDATA[几种随机数]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84279270</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84279270</guid><author>shenjun134</author><pubDate>Tue, 28 Aug 2012 10:12:04 +0800</pubDate><description><![CDATA[[b] 摘要：[/b]众所周知，随机数是任何一种编程语言最基本的特征之一。而生成随机数的基本方式也是相同的：产生一个0到1之间的随机数。看似简单，但有时我们也会忽略了一些有趣的功能。

众所周知，随机数是任何一种编程语言最基本的特征之一。而生成随机数的基本方式也是相同的：产生一个0到1之间的随机数。看似简单，但有时我们也会忽略了一些有趣的功能。

我们从书本上学到什么？

最明显的，也...]]></description><category></category></item><item><title><![CDATA[Cygwin 的下载安装 介绍]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84279260</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84279260</guid><author>shenjun134</author><pubDate>Tue, 28 Aug 2012 09:58:51 +0800</pubDate><description><![CDATA[下面是具体的安装步骤：
[url]http://www.programarts.com/cfree_ch/doc/help/UsingCF/CompilerSupport/Cygwin/Cygwin1.htm[/url]

这里是Cygwin[url]http://cygwin.com/packages/[/url]的主页，可以选择自己区域的site 进行下载安装~

可以先在主页上下载...]]></description><category></category></item><item><title><![CDATA[如何是用annotation 介绍]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84279091</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84279091</guid><author>shenjun134</author><pubDate>Mon, 27 Aug 2012 17:32:07 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.annotation;

import java.lang.annotation.ElementType;
import java.lang.annotation.Retention;
import java.lang.annotation.RetentionPolicy;
import java.lang.annotation.Targ...]]></description><category></category></item><item><title><![CDATA[XNotePad 切割txt文件]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84278996</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84278996</guid><author>shenjun134</author><pubDate>Mon, 27 Aug 2012 15:48:32 +0800</pubDate><description><![CDATA[可以通过这个软件切割文件，比如有些日志文件比较大，一般的软件是打不开的，但是可以通过下面的这个软件打开，他的原理就是把文件分割成很多小文件，然后一一打开。因为现在做开发，log会很多，一般都是几个g，普通的notepad++肯定是打不开的，这时候可以派上用场~...]]></description><category></category></item><item><title><![CDATA[二维码的生成]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84278186</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84278186</guid><author>shenjun134</author><pubDate>Fri, 24 Aug 2012 17:11:47 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.gce;

import java.io.*;
import java.util.Date;

import java.awt.*;
import java.awt.image.*;
import javax.imageio.*;
import com.swetake.util.Qrcode;

public class QRC...]]></description><category></category></item><item><title><![CDATA[各种四舍五入的模式]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84278180</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84278180</guid><author>shenjun134</author><pubDate>Fri, 24 Aug 2012 17:02:31 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.sc;

import java.math.RoundingMode;
import java.text.NumberFormat;

public class DoubleTest {
	public static void main(String[] args) {
//		test1();
		test2();
	}
	...]]></description><category></category></item><item><title><![CDATA[扫雷算法]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84277829</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84277829</guid><author>shenjun134</author><pubDate>Fri, 24 Aug 2012 09:17:29 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.common;

public class Constant {
	public static final String MINE = &quot;*&quot;;

	public static int PANEL_SIZE = 10;

	public static int MINE_SIZE = 10;
	
	public static int...]]></description><category></category></item><item><title><![CDATA[Josephu问题实现]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84277307</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84277307</guid><author>shenjun134</author><pubDate>Thu, 23 Aug 2012 09:36:29 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.acm;

import java.util.ArrayList;
import java.util.List;

import com.bean.Node;

public class Josephu {
	public static void generate(){
		int totalP = 41;
		int dead...]]></description><category></category></item><item><title><![CDATA[分数加减乘除 实现]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84277306</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84277306</guid><author>shenjun134</author><pubDate>Thu, 23 Aug 2012 09:36:08 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.bean;

public class Fraction {
	private Integer molecule;
	private Integer denominator;//!=0
	
	public Fraction(Integer molecule, Integer denominator){
		this.denominat...]]></description><category></category></item><item><title><![CDATA[单链表实现]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84277305</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84277305</guid><author>shenjun134</author><pubDate>Thu, 23 Aug 2012 09:35:50 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.bean;

public class Node {
	private T data;
	private Node next;
	private Node previous;
	
	public Node(){
	}
	
	public Node(T data){
		this.data = data;
	}
	
	pu...]]></description><category></category></item><item><title><![CDATA[迷宫算法实现]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84277032</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84277032</guid><author>shenjun134</author><pubDate>Wed, 22 Aug 2012 15:56:15 +0800</pubDate><description><![CDATA[定义一个二维数组：

int maze[5][5] = {
0, 1, 0, 0, 0,  
0, 1, 0, 1, 0,  
0, 0, 0, 0, 0,  
0, 1, 1, 1, 0,  
0, 0, 0, 1, 0,  
};
它表示一个迷宫，其中的1表示墙壁，0表示可以走的路，只能横着走或竖着走，不能斜着走，要求编程序找出从左上角到右下角的最短路线。
[code=&quot;j...]]></description><category></category></item><item><title><![CDATA[全排列算法实现]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84277029</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84277029</guid><author>shenjun134</author><pubDate>Wed, 22 Aug 2012 15:52:39 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.arithmetic;

import java.util.ArrayList;
import java.util.List;

public class PermutationsCombinations {
	public static void generate(int count) {
		String[] original =...]]></description><category></category></item><item><title><![CDATA[数独算法实现（循环方式）]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84276962</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84276962</guid><author>shenjun134</author><pubDate>Wed, 22 Aug 2012 14:25:13 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.sudoku;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;

public class Sudoku {
	private static int[][] DATA = new int[9][9];
	private stat...]]></description><category></category></item><item><title><![CDATA[数独算法实现（递归方式）]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84276954</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84276954</guid><author>shenjun134</author><pubDate>Wed, 22 Aug 2012 14:16:51 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.sudoku;

public class sodu {
	private int[][] sodu = null;
	private int[] tai = null;

	/**
	 * 构造方法 因为每执行一次递归都会把数组tai元素全置为-1. 所以在执行一次递归后需要重新给tai赋值。
	 */
	public sodu...]]></description><category></category></item><item><title><![CDATA[各类排序算法实现]]></title><link>https://blog.youkuaiyun.com/shenjun134/article/details/84276952</link><guid>https://blog.youkuaiyun.com/shenjun134/article/details/84276952</guid><author>shenjun134</author><pubDate>Wed, 22 Aug 2012 14:15:06 +0800</pubDate><description><![CDATA[[code=&quot;java&quot;]package com.arithmetic;

import java.util.Random;

public class SortAlgorithm {
	public static void bubbleSort(int[] list) {
		long startTime = System.currentTimeMillis();
		int te...]]></description><category></category></item></channel></rss>