Groklaw - Digging for Truth

	When you want to know more...

Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines

ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

You won't find me on Facebook

Donate

No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.

What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments

Sponsors

Hosting:

On servers donated to ibiblio by AMD.

Webmaster

pattern matching is iterative | 319 comments | Create New Account

Comments belong to whoever posts them. Please notify us of inappropriate comments.

pattern matching is iterative

Authored by: Anonymous on Friday, May 18 2012 @ 11:25 PM EDT

The parent and grandparent are both right. Any type of pattern matcher
will iterate through the input bytecodes in some way, bailing out as soon
as it runs into something unexpected. This pattern is simple and linear,
suitable for a DFA matcher (a regular expression), but even that seems
more complicated than necessary. No recursion is needed, although a
linear traversal like this could also be written recursively... But except in a

functional programming language, there is no reason to do it like that. I'm
too lazy to check what Dalvik actually does. But if I were given this
problem and asked to solve it in C++ or a similar language, I would just
use a for loop to linearly scan through the bytecodes and recognize (i.e.
pattern-match) each group of 4 instructions, and collect up the constants.

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )