Algorithms

int i1=0;
int i2=0;

for (; i1<10; i1++) {
    for (; i2<10; i2++) {
        Console.WriteLine("i1="+i1+"  i2="+i2);
    }
}

ResultSet rs = null;
ResultSet rs2 = null;
try {
    String firstword = null;
    String keyword = null;
    int number = 0;

    String sql = "Select * from smsserver_in";
    rs = db.SelectDB(sql);
    while (rs.next()) {
        StringTokenizer st = new StringTokenizer(rs.getString("text"));
        firstword = st.nextToken();
        //out.println("1"+firstword);
        number = rs.getInt("id");

        String sql1 = "Select * from USERAPP";
        rs2 = db.SelectDB(sql1);
        while (rs2.next()) {
            keyword = rs2.getString("keyword");
            //out.println("2"+keyword);
            if (firstword.equals(keyword)) {
                out.println(number);
                String sql3 = "Insert into app_" + keyword + "(originator,text)values(" + rs.getString("originator") + ",'" + rs.getString("text") + "')";
                db.InsertDB(sql3);
                String sql4 = "delete from smsserver_in where id=" + number;
                db.UpdateDB(sql4);
            }
        }

    }
} catch (Exception ex) {
}

Richard Andrew x64 wrote:

by tokens that a parser can understand

Richard Andrew x64 wrote:

is it possible to use parsing technology for broader things than just compilers?

Richard Andrew x64 wrote:

I've just begun studying parsing and lexical analysis, and I find it fascinating.

Richard Andrew x64 wrote:

I wonder if parsing algorithms could be used to make a computer understand, say, the rules of a game, or the design of a spacecraft.

Richard Andrew x64 wrote:

In other words, if we can represent concepts by tokens that a parser can understand, is it possible to use parsing technology for broader things than just compilers?